• CSCD核心库收录期刊
  • 中文核心期刊
  • 中国科技核心期刊

Electric Power Construction ›› 2019, Vol. 40 ›› Issue (12): 104-112.doi: 10.3969/j.issn.1000-7229.2019.12.013

Previous Articles     Next Articles

Distribution Network Planning Method with Feasible Domain-Wide Steiner Point Optimization Capability

SHI Pengjia 1, LEI Yong 1, ZHANG Linyao 1, WANG Qiulin2, LIU Xin2, TANG Yingqi 3, DONG Shufeng3   

  1. 1. Institute of Economics and Technology, State Grid Fujian Electric Power Co., Ltd., Fuzhou 350012, China;2. Fujian Yirong Information Technology Co., Ltd., Fuzhou 350003, China;3. College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China
  • Online:2019-12-01
  • Supported by:
    This work is supported by National Natural Science Foundation of China (No. 51677165).

Abstract: This paper mainly studies the problem of frame planning in distribution network planning. A new planning method for distribution network is proposed on the basis of Steiner Minimum Tree, which is to solve the problems with no consideration in the introduction of intermediate nodes and searching the best solution in the feasible areas in the planning of the previous research. Firstly, this paper establishes a mathematical model of distribution network planning using the path description method. Then it converts the mathematical model into a Euclidean Steiner Minimum Tree problem and uses the simulated annealing algorithm to solve it. By heuristically searching the Steiner point in the algorithm, we have made searching for intermediate nodes in feasible regions possible and we have expanded the selection range of intermediate nodes. In addition, we have also increased the probability of searching for a global optimal solution. Finally, the performance and effectiveness of the algorithm are verified by example analysis.

Key words: distribution network planning, path description, Steiner minimum tree, simulated annealing algorithm

CLC Number: