Load Flow Analysis For Radial Distribution Networks

Abstract

In the thesis a simple method to solve the load-flow problem of radial distribution networks is reported. This algorithm easily computes the power flow through any branch exploiting the radial feature of the distribution networks. The proposed method finds the clusters of branches for feeders, laterals and sub laterals. Each clusters contains branches which are connected in a chain. If the receiving-end node of any branch ( say ‘a’ ) has more than one outgoing branches. This branch (a) is marked 2. If the receiving end node of any branch ( say ‘b’ ) has one outgoing branch, this branch (b) is marked 1. This method computes not only voltage magnitude but also computes voltage angles. The proposed method has been tested by two examples ( 33-node and 69- node radial distribution networks ). The proposed method converged well for constant power, constant current, constant impedance, composite and exponential load modeling. The method has also been tested for different R/X ratio of every branch changing R of each branch in each time by a particular constant. The superiority of the proposed method is checked by it CPU time and memory requirement with other methods [ 11, 19, 25 ].