Distribution Load Flow Methods

1. Forward/backward sweep methods

2. Load Flow Based on Sensitivity Matrix for

Mismatch Calculation

3. Bus Impedance Network

Forward/backward sweep methods
• Distribution system is modeled as a tree.
• The slack bus is the root of the tree and the far
away nodes as the leaves
• Weakly meshed networks are converted into the
radial networks by breaking the loop.
• The backward sweep sums either the line
currents or the load powers from the leaf to the
root.
• The forward sweep calculates the node voltage
from root towards the leaves.
 Nodes Identification
• For branch power calculations, the adjacent
nodes and branches of every node are
identified with the help of different
algorithms:
– Branch and node-oriented method
– (Reverse) Breadth first search method
– ……..
44
45
 Solution Methods
1. Kirchhoff’s Law based method (Current
Summation Method)
2. Power Summation method
Algorithm 1: Kirchhoff’s Law Based
• Select the slack bus(root) and assume initial
voltage and its angle at the root node and the
other buses.
• Compute nodal current injections using:

• Start from the root node with known slack bus

voltage and move towards leaves (Feeder and
lateral ends)
• Calculate the voltage at any node ‘j’ using:

• Compute power mismatch and check the

termination criteria using:

• If the termination criteria is not met, then

repeat the process.
 Algorithm 2

Power Summation Method

50
51
Flow Chart
 Active, Reactive power losses

• Voltage Deviation

53
Voltage Stability Index

54
Example

Fig. 10.3