Faster load flow algorithm for radial distribution network using graph theory

Abstract

Since last 3 decades, load flow solutions have enjoyed success on different fronts. Primarily, the importance and utility of these algorithms is assessed using performance measures, which usually include issue like implementation complicacy, optimized execution time, and memory storage. In this work, a graph-theoretical approach is used to facilitate load flow solutions for a static network topology. Algorithm is tested for 2 different radial distribution topologies, and its deployment for both of these network finally results in phenomenal saving on 2 important algorithm performance measures, ie, time and space complexity. Obtained phenomenal saving for both of these 2 parameters is compared with earlier reported work on statistical basis. © 2018 John Wiley & Sons, Ltd.