Electric Power ›› 2022, Vol. 55 ›› Issue (6): 33-41.DOI: 10.11930/j.issn.1004-9649.202007222

• Study of Power Grid Dispatching Models • Previous Articles     Next Articles

Fast Multi-stage Reconfiguration Method for Distribution System Based on Greedy Algorithm

ZHAO Shengju1, YAO Li1, LIN Jikeng2, ZHANG Xu1   

  1. 1. School of Electronic Information Engineering, Tianjin University, Tianjin 300072, China;
    2. School of Electrical Engineering, Tongji University, Shanghai 201804, China
  • Received:2020-08-07 Revised:2021-02-18 Online:2022-06-28 Published:2022-06-18
  • Supported by:
    This work is supported by National Natural Science Foundation of China (Model and Optimization of Power Island in Smart Grid Based on Graph Theory, No.51177107)

Abstract: Aiming at the slow-speed computation problem of the multi-stage dynamic reconfiguration, a new dynamic reconfiguration method is proposed. Based on the given optimization scale parameter M, the proposed method makes all possible merges for 2M+2 phases which are centered on the two successive phases with the highest number of switching actions, and carries out static reconfiguration for each new merged phase, and then selects the merging scheme with a minimum objective function value as the current optimal merging scheme; repeat the iteration until the objective function value is no longer reduced and the current solution is a feasible solution, thereby obtaining the approximate optimal solution. On the premise of obtaining an approximate solution to the global optimal solution, the calculation speed is nearly 2 orders of magnitude faster than the global optimal solution. Case study shows that the proposed method has good engineering application prospect because of its high efficiency in solution.

Key words: distribution network reconfiguration, optimal flow method, Mayeda spanning tree, greedy algorithm, multi-stage dynamic reconfiguration