Researches On Heuristic Algorithms For Distribution Network Reconfiguration

The construction of intelligent, efficient, reliable, and green modern distribution network pays more attention to the standardization and normalization. Distribution network reconfiguration is an important link of power distribution network automation system. This topic researches the heuristic algorithms in the application of the distribution network reconfiguration, summarizes the heuristic algorithms proposed in recent years and classified into two types: open tie switches and close all switches. Using three classical test system: IEEE16、IEEE33、PG&E69 and three large real networks:Taipower84、Bus119、Bus136 as examples to achieve a variety of network reconfiguration calculation of heuristic algorithm on the same platform and analyze its performance.The algorithms of opening tie switches as follows: Distribution network reconfiguration algorithm based on minimum current loop update was proposed in this paper. The circulation update mechanism is introduced into the algorithm to make the feasible solution search wider. Combining with branch exchange method and cyclic update, the distribution network reconfiguration algorithm is proposed based on neighboring branch circulation update. In order to exert CMCU and CNCU their respective advantages, using the final solution of CMCU as the initial solution of CNCU, the distribution network reconfiguration algorithm is proposed based on the minimum current and neighboring branch. The algorithm has strong versatility and accuracy, and can converge to global optimal. The distribution network algorithm based on the loop elimination is proposed by contacting switch voltage difference on both ends is greater than the given value as the convergence condition. The algorithm does not need a large number of network trend and it’s convergence speed is fast.For all switches closed algorithms adopted as follows: The distribution network reconfiguration algorithm based on power network loss increase minimum is proposed based on closed all switch form of mesh network. The distribution network algorithm based on the loop elimination is proposed by contacting switch voltage difference on both ends is greater than the given value as the convergence condition. The algorithm does not need a large number of network trend and it’s convergence speed is fast. The distribution network reconfiguration algorithm based on sensitivity method mixed with branch exchange method is proposed according to the network active power loss sensitivity of branch impedance.Taking IEEE33 and Taipower84 system for examples, the algorithm reconstruction results were analyzed respectively from the reconstructed computing time, number of power flow calculation, final network losses and minimum system node voltage. And evaluating the performance refactoring algorithm by joining algorithm generality index.