Load Restoration in Distribution System using Minimum Spanning Tree - Prim's Algorithm

Abstract

Power outage is detrimental to the grid system therefore solving the issue within a short amount of time is indeed compulsory. Load restoration is one the solution required in ensuring the load can be connected within short amount of time. This study proposes a methodology to solve the load restoration problem using minimum spanning tree by determining the switching sequence according to the Prim’s algorithm. By using this algorithm, the switching is done based on the most minimum path which refer to the flow of power through the minimal value of weighted impedances. This method ensures that the losses is minimized and the voltage limit is not violated. The load restoration in this study focuses on reconfiguring the tie-lines in the 33-bus radial distribution network. Results obtained shows that Prim’s algorithm is effective in restoring the loads by reconfiguring the network in a way that total active power losses are minimized. This algorithm is also compared with the Binary Particle Swarm Optimization (BPSO) to prove the effectiveness of this method thus enhancing the power system reliability.