Power distribution network reconfiguration based on min-cost flow problem

被引：0

作者：

Zazou, Abdelkrim Ali ^{[1
,2
]}

Grolleau, Emmanuel ^{[2
]}

Chevrier, Emilie ^{[1
]}

Richard, Pascal ^{[3
]}

Gaubert, Jean-Paul ^{[3
]}

Bellatreche, Ladjel ^{[2
]}

机构：

[1] SRD, Poitiers, France

[2] ENSMA, Poitiers, France

[3] Univ Poitiers, Poitiers, France

来源：

2016 IEEE 14TH INTERNATIONAL CONFERENCE ON INDUSTRIAL INFORMATICS (INDIN) | 2016年

关键词：

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper a network reconfiguration model aimed to be used in an industrial context is presented. It is based on a min-cost flow problem (MCFP) and a simplified power flow calculation. Mixed Integer Quadratic Constrained Programming (MIQCP) and Mixed Integer Non linear Programming (MINLP) are used and compared to compute the network reconfiguration with off-the-shelf optimization solvers. Two test cases are presented, a small academic network and a real case study. The paper shows experimentally that simplification on model level can be more efficient than simplification on the solving level for real world problems.

引用

页码：286 / 291

页数：6

共 50 条

[21] Min-cost bin covering problem and its algorithm
College of Computer and Communication, Hunan Univ., Changsha 410082, China
不详
[J]. Hunan Daxue Xuebao, 2008, 2 (77-79): : 77 - 79
[22] Multicore Parallelization of Min-Cost Flow for CAD Applications
Lu, Yinghai
Zhou, Hai
Shang, Li
Zeng, Xuan
[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2010, 29 (10) : 1546 - 1557
[23] Robust Multi-Object Tracking Based On Higher-order Graph And Min-cost Flow Network
Han, Guang
Yu, Xiaoyi
Liu, Liu
[J]. 2017 4TH INTERNATIONAL CONFERENCE ON SYSTEMS AND INFORMATICS (ICSAI), 2017, : 484 - 490
[24] MULTI-OBJECT TRACKING BY VIRTUAL NODES ADDED MIN-COST NETWORK FLOW
Liu, Peixin
Li, Xiaofeng
Feng, Haoyang
Fu, Zhizhong
[J]. 2017 24TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2017, : 2577 - 2581
[25] Min-cost flow-based algorithm for simultaneous pin assignment and routing
Xiang, H
Tang, XP
Wong, MDF
[J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2003, 22 (07) : 870 - 878
[26] Multicore Parallel Min-Cost Flow Algorithm for CAD Applications
Lu, Yinghai
Zhou, Hai
Shang, Li
Zeng, Xuan
[J]. DAC: 2009 46TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2, 2009, : 832 - +
[27] The min-cost parallel drone scheduling vehicle routing problem
Nguyen, Minh Anh
Dang, Giang Thi-Huong
Ha, Minh Hoang
Pham, Minh-Trien
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 299 (03) : 910 - 930
[28] A Simple Efficient Interior Point Method for Min-Cost Flow
Becker, Ruben
Karrenbauer, Andreas
[J]. ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 753 - 765
[29] A Firefly Algorithm Based Approach for the Two-dimensional Min-Cost Covering Problem
Lu, Sichao
Wang, Xifu
[J]. PROCEEDINGS OF 2015 6TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE, 2015, : 1003 - 1006
[30] Diagnosing infeasibility in min-cost network flow problems part ii. Primal infeasibility
Greenberg, H.J.
[J]. IMA Journal of Mathematics Applied in Business and Industry, 1988, 2 (01):

← 1 2 3 4 5 →