A Robust Load Flow Algorithm to Solve Power Distribution Network Reconfiguration Problem with a Population Based Meta-heuristic Approach

While solving the power distribution network reconfiguration problem, it may be required to execute a series of load flows for continuously changing topologies of distribution networks so as to obtain an optimal radial network. The number of required load flows grows even more when a population based meta-heuristic search is followed. In this paper, a robust load flow algorithm is proposed which is independent of any particular pattern of node numbering scheme and input data. This algorithm also has an inbuilt mechanism of checking connectivity of all nodes to the substation node(s) and the radial topology of the distribution network making it suitable for population based meta heuristic search. The algorithm is implemented with randomly generated configurations for several test radial distribution networks (RDN) and reconfiguration results are analyzed.