Electric Power ›› 2018, Vol. 51 ›› Issue (9): 110-117.DOI: 10.11930/j.issn.1004-9649.201805095

Previous Articles     Next Articles

A New Method for One-Stage Distribution System Reconfiguration Based on Optimal Flow Algorithm and Mayeda Spanning Tree Algorithm

ZHANG Zhongshi1, WANG Gaomeng2, ZHANG Tanyong3, LIN Jikeng4   

  1. 1. State Grid Energy Research Institute Co., Ltd., Beijing 102209, China;
    2. Key Laboratory of Smart Grid of Ministry of Education, Tianjin University, Tianjin 300072, China;
    3. State Grid Beijing Maintenance Company, Beijing 100021, China;
    4. College of Electronic and Information Engineering, Tongji University, Shanghai 201804, China
  • Received:2018-05-17 Revised:2018-06-20 Online:2018-09-05 Published:2018-09-20
  • Supported by:
    This work is supported by Science and Technology Project of SGCC (Research on parameter identification and operation analysis technology of urban distribution network, No.KJ17-1-09).

Abstract: For the problem that the stochastic optimization algorithms have long calculation time and the heuristic algorithm has low accuracy when used for distribution network reconfiguration, this paper presents a new method of one-stage distribution network reconfiguration based on the optimal flow method and Mayeda spanning tree algorithm. The optimal flow method is employed to quickly select the branches that are used for branch exchanging in the Mayeda spanning tree algorithm from the candidate sets of branch exchanging, which avoids the slow evolution problem of the stochastic evolutionary selection method as well as the problem of too many poor trees generated by the exhaustive method, and is equivalent to partially eliminating the trees that are worse than the current tree by using the optimization technique, consequently speeding up the searching process for the optimal tree. The proposed method enjoys the advantages of the efficiency of the optimal flow method and the completeness of the solution space of Mayeda spanning tree algorithm, which are well integrated to improve the computational efficiency. The proposed method has been proved effective by case study and is valuable for engineering application due to its efficiency and its ability to find at least a suboptimal solution.

Key words: distribution network, reconfiguration, optimal flow algorithm, Mayeda spanning tree, efficiency, solution space, completeness

CLC Number: