Dynamic Reconfiguration of Distribution Network Based on Temporal Constrained Hierarchical Clustering and Fireworks Algorithm

For the dynamic reconfiguration problem of distribution networks, the handling of switching cost constraint and the division of time period are the two key aspects that affect the performance of the reconfiguration algorithm. In this paper, an improved temporal constrained hierarchical clustering algorithm for dynamic reconfiguration of distribution networks is proposed. Firstly, the improved hierarchical clustering approach considering the temporal constraint is used to divide the operating status of the distribution network into multiple time intervals according to the similarity of loads and the output power of distributed generations (DGs). The dynamic reconfiguration of distribution networks is then transformed into multiple single-stage static reconfiguration problems, and the cluster center is used to approximately represent the load state and DG output state of the period. In order to reduce the number of infeasible solutions and poor solutions, a coding method based on heuristic rules to reduce the solution space of distribution network reconfiguration is proposed. An improved fireworks algorithm based on heuristic rules is proposed to solve the reconfiguration problem. Finally, a modified IEEE-33 test system is used to verify the validity of the proposed method.