A Piecewise Solution to the Reconfiguration Problem by a Minimal Spanning Tree Algorithm

This paper proposes a minimal spanning tree (MST) algorithm to solve the networks' reconfiguration problem in radial distribution systems (RDS). The paper focuses on power losses' reduction by selecting the best radial configuration. The reconfiguration problem is a non-differentiable and highly combinatorial optimization problem. The proposed methodology is a deterministic Kruskal's algorithm based on graph theory, which is appropriate for this application generating only a feasible radial topology. The proposed MST algorithm has been tested on an actual RDS, which has been split into subsystems.