Dynamic Reconfiguration of Active Distribution System Based on Matrix Shifting Operation and Interval Merger

Dynamic distribution system reconfiguration (DDSR) is a complex NP-hard combinatorial optimization problem when the time varying nature of loads and distribution generation power output are taken into account. Solving the DDSR problem is challenging in terms of computational burden and solution quantity. In this paper, a matrix shifting and interval merger based DDSR algorithm is proposed for line loss reduction. First of all, the matrix of branch power and the vector of line resistance are formulated, and the matrix shifting operation is defined for static reconfiguration in an interval. Then, the reconfiguration is firstly operated in each hour, and the adjacent intervals are selected to be merged into one new interval constantly, which ensures the validity of the interval merger. Meanwhile, a hash table is established to store the exiting reconfiguration schedules to avoid repeated power flow calculations and reduce the compute burden. Finally, the proposed dynamic reconfiguration algorithm is applied to three test systems. The simulation results show that the proposed reconfiguration algorithm can achieve optimal solutions with acceptable computational cost.