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 条
  • [1] To Solve the Problem of Constrained Assignment by Min-Cost Flow
    Chi, Jie
    Wei, Guangxing
    [J]. PROCEEDINGS OF 2008 INTERNATIONAL SYMPOSIUM ON APPLIED COMPUTING AND COMPUTATIONAL SCIENCES: ADVANCES IN APPLIED COMPUTING AND COMPUTATIONAL SCIENCES, 2008, : 23 - 26
  • [2] An exact algorithm for the min-cost network containment problem
    Pesenti, R
    Rinaldi, F
    Ukovich, W
    [J]. NETWORKS, 2004, 43 (02) : 87 - 102
  • [3] Approximating the single source unsplittable min-cost flow problem
    Skutella, M
    [J]. MATHEMATICAL PROGRAMMING, 2002, 91 (03) : 493 - 514
  • [4] Approximating the single source unsplittable min-cost flow problem
    Martin Skutella
    [J]. Mathematical Programming, 2002, 91 : 493 - 514
  • [5] Approximating the single source unsplittable min-cost flow problem
    Skutella, M
    [J]. 41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2000, : 136 - 145
  • [6] Belief Propagation for Min-cost Network Flow: Convergence & Correctness
    Gamarnik, David
    Shah, Devavrat
    Wei, Yehua
    [J]. PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 279 - +
  • [7] MIN-COST FLOW NETWORK TO DETECT TEXT LINE ON CERTIFICATE
    Rianto, Indra
    Rainarli, Ednawati
    [J]. JOURNAL OF ENGINEERING SCIENCE AND TECHNOLOGY, 2021, 16 (05): : 3726 - 3736
  • [8] Belief Propagation for Min-Cost Network Flow: Convergence and Correctness
    Gamarnik, David
    Shah, Devavrat
    Wei, Yehua
    [J]. OPERATIONS RESEARCH, 2012, 60 (02) : 410 - 428
  • [9] Integrality in the multinetwork min-cost equal-flow problem
    Hassin, Refael
    Poznanski, Renata
    [J]. NETWORKS, 2022, 80 (03) : 267 - 273
  • [10] Optimal road matching by relaxation to min-cost network flow
    Wu, Hangbin
    Xu, Shan
    Huang, Shengke
    Wang, Junhua
    Yang, Xuan
    Liu, Chun
    Zhang, Yunling
    [J]. INTERNATIONAL JOURNAL OF APPLIED EARTH OBSERVATION AND GEOINFORMATION, 2022, 114
12345