Three-Phase Symmetric Distribution Network Fast Dynamic Reconfiguration Based on Timing-Constrained Hierarchical Clustering Algorithm

This paper develops a novel dynamic three-phase symmetric distribution network reconfiguration (DNR) approach based on hierarchical clustering with timing constraints, which can divide the time period according to the time-varying symmetric load demand and symmetric distributed generations (DGs) output condition for a given time interval. The significance of the proposed technique is that by approximating the cluster center as the load status and DGs output status of the corresponding period, in this way, the intractable dynamic reconfiguration problem can be recast as multiple single-stage static three-phase symmetric DNR problems, which can effectively reduce the complexity of the three-phase symmetric dynamic reconfiguration. Furthermore, an improved fireworks algorithm considering heuristic rules (H-IFWA) is proposed and investigated to efficiently manage each single-stage static three-phase symmetric DNR problem. In order to avoid trapping into a local optimum or to facilitate the computational performance, the power moment method and the coding method based on heuristic rules are employed to reduce the solution space. The effectiveness of the proposed H-IFWA is validated on the IEEE 33, 119-bus system and a practical-scale Taiwan power company (TPC) 84-bus test system with DGs.