Optimum dynamic distribution network reconfiguration using minimum spanning tree algorithm

Distribution networks reconfiguration is among the main tasks in distribution management system. The networks reconfiguration is determined by opening and closing switches devices. This reconfiguration can be static or dynamic. In static reconfiguration, the loads are assumed to be constant, while in dynamic reconfiguration loads are assumed to vary according to time. In this work, a dynamic reconfiguration considering the load variation was proposed. A minimum spanning tree (MST) based on Kruskal's algorithm has been applied to find the optimal reconfiguration under multi times, with minimizing the total power loss as objective function. This algorithm was tested on IEEE (33-nodes, 84-nodes) and validated on Algerian distribution network (116 node), using MATLAB Software.