1. Distribution load flow methods include forward/backward sweep methods, methods based on sensitivity matrices, and bus impedance network methods.
2. Forward/backward sweep methods model the distribution system as a tree with the slack bus at the root and leaves at the far nodes, summing currents or powers from leaves to root in the backward sweep and calculating voltages from root to leaves in the forward sweep.
3. Solution methods include Kirchhoff's law based current summation and power summation, with the current summation method computing nodal voltages starting from the slack bus voltage and moving towards leaves using nodal current injections.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
168 views15 pages
Lecture 3 - Forward Backward Sweep Method
1. Distribution load flow methods include forward/backward sweep methods, methods based on sensitivity matrices, and bus impedance network methods.
2. Forward/backward sweep methods model the distribution system as a tree with the slack bus at the root and leaves at the far nodes, summing currents or powers from leaves to root in the backward sweep and calculating voltages from root to leaves in the forward sweep.
3. Solution methods include Kirchhoff's law based current summation and power summation, with the current summation method computing nodal voltages starting from the slack bus voltage and moving towards leaves using nodal current injections.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15
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: