Load Flow of Distribution System Using Graph Algorithm

Abstract

Load Flow analysis is significant mechanism which is used in all the aspects of designing, operation as well as expansion of distribution system. It is the study which comprises the research of foremost importance. This analysis displays capability of electrical power system as well as flow of power i,e real and reactive for specific state during the steady state operating conditions of system. A large number of methods have been developed till date for analyzing the load flow solution of distribution systems. Graph algorithms has become vital for the load flow solution of distribution network, which leads to traversal of the graph either in breadth first manner known as Breadth first search algorithm or depth first mode knowns as Depth first search algorithm so that each node is absolutely visited once in a precise order. In this dissertation, firstly adjacency matrix is developed from the single line diagram of distribution network in order to make a biograph. Biograph is then traversed in Breadth first search algorithm that leads to the exploration of power flow paths and two different matrices are constructed, Bus Injection to Branch Current Matrix (BIBC) and Branch Current to Bus Voltage Matrix (BCBV) for load flow solution. Secondly different types of loads are calculated at rated voltage, after which Backward/Forward sweep is employed in order to update currents and voltages at every individual bus of the distribution system. Thus completing the load flow process and the results are obtained. The results are compared with other methods and are tested on IEEE-15, 28 & 33 bus system.