0% found this document useful (0 votes)
3 views

APS Lecture 9 Loadflow

Uploaded by

sulakshana
Copyright
© © All Rights Reserved
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% found this document useful (0 votes)
3 views

APS Lecture 9 Loadflow

Uploaded by

sulakshana
Copyright
© © All Rights Reserved
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/ 27

Advanced Power System Analysis

Elective -II
(Course Code: EE 785 )

Lecture No.9

( Load-Flow Analysis – Gauss-Siedal Method )

1
LOAD FLOW ANALYSIS

1. General Form of Load Flow Equation :


In load flow study, we do the analysis of power system network with multiple
number of bus and calculate :
- Magnitude and phase of voltage of each bus.
- P and Q flow from one bus to another bus through transmission lin
(For a given condition of load at all the buses.)

A bus bar of a power system is normally associated with the following four quantities :
i) | V | = Magnitude of voltage of the bus.
ii)  = Phase angle of the bus voltage w.r.t. a reference bus voltage phasor
iii) P = Net active power drawn by the load from the bus
iv) Q = Net reactive power drawn by the load from the bus

Normally , at each bus, two quantities are specified and other two quantities will be
determined by load flow analysis. In the load flow analysis, we define three types
of bus as follow :

2
Load Flow Analysis Contd …..

Bus Type Quantities Quantities to be


Specified determined
Reference Bus |V|, P and Q
Generator Bus |V|, P Q, 

Load Bus P and Q |V|,

Fig.1 Typical example of power system network with 4 buses

3
Load Flow Analysis Contd …..
Why Iterative method is required to perform Load-Flow Analysis?

Here, Bus-1 is Ref Bus whose VS<0 is known.


For given condition of load at Bus-2 (PL + jQL), magnitude and phase of voltage at Bus-2 need to be
calculated. That means- | VR| and δ need to be calculated.
~ ~ ~
VR  VS - I (R  jX) eqn1
~ ~
~ VS - VR
I 
R  jX

~ ~ ~ *~ ~ P - Q
PL  jQ L  VR . I * OR PL  jQ L  VR . I OR I 
L L
~ *
V
R
As per eqn-1, in order to calculate VR, I is required.
And in order to calculate I, VR is required.

Hence, iterative method is required to solve such load-flow problem.

4
Load Flow Analysis Contd …..

The Ybus for the above network can be formulated as :


Y11 Y12 Y13 Y14

Y21 Y22 Y23 Y24


Ybus =
Y31 Y32 Y33 Y34

Y41 Y42 Y43 Y44

The net current injection at each bus is given by :

I1 Y11 Y12 Y13 Y14 V1

I2 Y21 Y22 Y23 Y24 V2


= 
I3 Y31 Y32 Y33 Y34 V3

I4 Y41 Y42 Y43 Y44 V4

5
Load Flow Analysis Contd …..
I1 = Y11 V1 + Y12 V2 + Y13 V3 + Y14 V4
I2 = Y21 V1 + Y22 V2 + Y23 V3 + Y24 V4 and so on

If there are n- number of buses, then

[ Ibus ] = n  1 matrix [ Vbus ] = n  1 matrix

[ Ybus ] = n  n matrix

In general, the current injection at kth bus is given by :

Ik = Yk1 V1 + Yk2 V2 + Yk3 V3 + ................+ Ykk Vk + ..................+ Ykn Vn


n
Or Ik = Y
n 1
kn . Vn .......... (1)

Let Ykn = | Ykn |  kn and Vn = | Vn |  n


n
Then Ik = | Y
n 1
kn | . | Vn |  n   kn .............. (2)

6
Load Flow Analysis Contd …..

The complex power injected into the kth bus is given by :


SK = PK + j QK = VK . IK* [ Where IK* = Complex conjugate of IK ]
Or SK* = PK - j QK = VK *. IK
S*K Pk - j Q k
IK  
Or V* K Vk*
* I  | V | n | Y || V | (     ) | Vk | n | Y || V |   (     )
Or PK - jQ  VK
k K k n
1 kn
n n kn k 
n1 kn
n k n kn

n n
Or Pk - jQ k  | Vk |  | Ykn | . | Vn | .Cos ( k   n   kn )  | Vk |  | Ykn | . | Vn | .Sin( k   n   kn )
n1 n1
Equating active and reactive parts, we get :
n
Pk  | Vk |  | Ykn | . | Vn | .Cos( k   n  kn) ............... (3)
n1
n
Qk  | Vk |  | Ykn | . | Vn | .Sin( k   n  kn) .............. (4)
n1
These two equations are known as static load flow equations. They are non-linear equations and only a
numerical iterative methods can solve these equations. These equations are used in different forms in
different method of load flow analysis.

7
Fast Decoupled Load Flow Method Contd …..
Example : let us consider a 4-bus system as shown below:
| V1 |1 (Given)

Bus-2 (Load Bus) Bus-1 (Ref Bus)


Bus-4 (Load Bus)

y12 y14 |V4| = ? , 4 = ?


P2 + j Q2
(Given)
P4 + j Q4
|V2 | = ? (Given)
y23 y34
2 = ?
Bus-3 (Load Bus)

P3 + j Q3 |V3 | = ? , 3 = ?
(Given)
Ybus elements are :

Y11 = y12 + y14 ; Y12 = - y12 ; Y13 = 0 ; Y14 = -y14

Y21 = -y12 ; Y22 = y12 + y23 ; Y23 = -y23 ; Y24 = 0

Y31 = 0 ; Y32 = - y23 ; Y33 = y23 + y34 ; Y34 = -y34

Y41 = -y14 Y42 = 0 Y43 = -y34 Y44 = y14 + y34

8
Fast Decoupled Load Flow Method Contd …..
.

Pk - j Qk
Ik   Yk1 V1  Yk2 V2  Yk3 V3  Yk4V4
Vk*

P2 - j Q 2
Or I 2   Y21 V1  Y22 V2  Y23 V3  Y24 V4
V2*
 
1  P2 - j Q 2
Or V2   Y21. V1  Y23 . V3  Y24 . V4 
Y22  V*
 2 

P - jQ 
Similarly, V3 
1  3 3  Y .V  Y .V  Y .V 
 31 1 32 2 34 4 
Y33  V3* 

 
1  P4 - j Q 4
And, V4    Y41. V1  Y42 . V2  Y43 . V3 
Y44
 V4* 

The above three equations shall be solved to calculate V2, V3 and V4.These equation can
not be solved by simple algebraic method. Some iterative methods like - Gauss-Seidal
method or Newton-Raphson method shall be used to solve these equations.

9
Gauss – Seidal Method
.

Gauss-Seidal Method :
This is an iterative method for solving non-linear equation. Let us try to
understand this method with an example for solving a set of non-linear algebraic
equations :

Algorithm :
- An initial guess is made for unknown quantities in the equation.

- By substituting the values of initial guess in the expression of equation, new


values of unknown quantities are calculated. This completes the 1st iteration.

- Start 2nd iteration :


By substituting the values of unknown quantities from 1st iteration, new values
of unknown quantities are calculated. This completes the 2nd iteration.

- Perform several iteration until the difference between last two successive
results <  (pre-assigned precession index)

10
Gauss – Seidal Method Contd …..

Example : Solve the non-linear equations :


2 X1 + X1. X2 - 1 = 0 ...... (1)
2X2 - X1. X2 + 1 = 0 ...... (2)
Re-arranging,
X1. X2
X1  0.5 - ............... (3)
2
X .X
X  - 0.5  1 2 ............... (4)
2 2

Iteration #1 :
Let initial guess of X1 and X2 be X1(0) = 0 and X2(0) = 0, Then
0 0 (1) 00
X(1)  0.5 -  0.5 And X2  - 0.5   - 0.5
1 2 2
Iteration #2 :
(1) (1)
(2) X1  X 2 (0.5)  ( 0.5)
X1  0.5  0.5 -  0.652
2 2

(1) (1)
(2) X1  X 2 (0.5)  ( 0.5)
X 2  - 0.5  - 0.5   - 0.652 And so on
2 2

11
Gauss – Seidal Method Contd …..
.

We can use EXCEL spread sheet to calculate these iterations. The results are :
Iteration # X1 X2
1 0.5 - 0.5
2 0.652 - 0.656
3 0.705 - 0.731
4 0.757 - 0.776
5 0.794 - 0.808
6 0.821 - 0.832
7 0.842 -0.832
. .
. .
. .
200 0.9926 - 0.9926
201 0.9927 - 0.9927

There are no significant change in the values of X1 and X2 after 200 iterations.

Hence, X1 = 0.9926  1.0 and X2 = - 0.9926  - 1.0 are the solutions.

12
Gauss – Seidal Method Contd …..

Gauss - Seidal Method for Load flow Analysis


Let us consider a three bus system as shown below :

| V1 | 1 = 1 | 00 (Given)

Bus - 2 (Load bus)


Bus-1 (Ref Bus) |V2| = ? , 2 = ?
y12 = -j 5.0 pu

P2 + j Q2
y13 = -j 4.0 pu y23 = -j 2.5 pu =( - 0.6 - j 0.3)pu

Bus - 3 (Load bus)


|V3| = ? , 3 = ?
P3 + j Q3
=( - 1.0 - j 0.75)pu

Y11 Y12 Y13 -j 9 j5 j4

Ybus = Y21 Y22 Y23 = j5 -j 7.5 j 2.5

Y31 Y32 Y33 j4 j 2.5 -j 6.5

13
Gauss – Seidal Method Contd …..

I1 Y11 Y12 Y13 V1

I2 = Y21 Y22 Y2  V2

I3 Y31 Y32 Y33 V3

 
1  P2 - j Q 2
We have, V2   Y21. V1  Y23 . V3 
Y22  V2*
 

 
1  P3 - j Q3
V3    Y31. V1  Y32 . V2 
Y33
 V3* 

These two equations shall be solved for V2 and V3.


Start with initial guess : V2 (0) = | V2 |  2 = 1  00 and V3 (0) = | V3 |  3 = 1  00

14
Gauss – Seidal Method Contd …..

First of all we shall carried out few iterations (say two iterations) to get corrected
values of V2 and 2 keeping the values of V3 and 3 as it is equal to | V2 |  2 = 1 00.
We shall call these few iterations as "local Iteration at bus-2". This local iteration will
improve the values of | V2 | and 2 towards their real solution.

After that we shall carried out the local iteration at bus-3 to improve the values of | V3 |
and 3. Then local iteration at bus-4 and so on up to local iteration at bus-n. This will
complete the main iteration #1.

Then we shall start the main iteration#2 which again contains the local iterations at bus-
2, bus-3 ....... bus-n.
The main iteration shall be stop at nth iteration, If

| V2 (n) - V2 (n-1) | <  , | 2(n) - 2(n-1) | < 

| V3 (n) - V3 (n-1) | <  , | 3(n) - 3(n-1) | < 


.....................................

| Vn (n) - Vn (n-1) | <  , | n(n) - 3(n-1) | < 

15
Gauss – Seidal Method Contd …..

The fig. below shows the Flow-chart for Gauss-Seidal method for load flow study.

Start Input data :


V1 , V2 (0) , V3 (0) ...... Vn (0)

Local Iteration at bus-2 V2


to improve V2 (1,1) V2 (1,2)

Local Iteration at bus-3 V3 (1,1)


to improve V3 V3 (1,2)

V2 (n-1) , V3 (n-1) ... Vn


(n-1)

Local Iteration at bus-n Vn


to improve Vn
(1,1) Vn (1,2)
NO
If
Yes
V2 (n) - V2 (n-1) < 
V2 (n) - V2 (n-1) < 
Stop
…………………
V2 (n) - V2 (n-1) < 
Then Stop

16
Gauss – Seidal Method Contd …..

Main iteration #1

Local Iteration #1 at bus -2 : Main Iteration#1


Local Iteration#1
 
1  P2 - j Q 2 
V2(1,1)    Y21. V1  Y23. V (0) 
Y22  V (0) * 3 
 2 
1  - 0.6  j 0.3 
Or V2(1,1)    j.5 (10)  j.2.5 (10)
- j7.5  (10) * 
Or V2 (1,1) = 0.96 - j.0.08 = 0.963 - 4.70 pu

Local Iteration #2 at bus -2 :


 
1  P2 - j Q2 (0) 
V2(1,2)   (1,1) *  Y21. V1  Y23. V3 
Y22  V 
 2 

1  - 0.6  j 0.3 
    
(1,2)
V2 j.5 (1 0) j.2.5 (1 0)
 j7.5  (10) * 

Or V2 (1,2) = 0.951 - j.0.0793 = 0.954  - 4.770 pu

17
Gauss – Seidal Method Contd …..

Local Iteration #1 at bus -3 :


 
1  P3 - j Q3 
V3(1,1)    Y31. V1  Y32. V (1,2) 
Y33  V (0) * 2 
 3 
1  -1  j 0.75 
Or V3(1,1)    j.4 (10)  j.2.5 (0.954   4.77 0 )
- j6.5  (10) * 
Or V3 (1,1) = 0.865 - j.0.184 = 0.884  - 12.070 pu
Local Iteration #2 at bus -3 :
 
1  P3 - j Q3 
V3(1,2)    Y31. V1  Y32. V (1,2) 
Y33  V (1,1)* 2 
 3 

1  -1  j 0.75 
Or V3(1,2)    j.4 (10)  j.2.5 (0.954  4.770 )
- j6.5  (0.88412.020 ) 
 

Or V3 (1,2) = 0.817 - j.0.173 = 0.835  - 11.980 pu

This is the end of Main iteration #1. The output from the main iteration#1 are :

V2 (1,2) = 0.951 - j.0.0793 = 0.954  - 4.770 pu


V3 (1,2) = 0.817 - j.0.173 = 0.835  - 11.980 pu

These values shall be used as the initial values for the main iteration#2.

18
Gauss – Seidal Method Contd …..

Main Iteration #2 :
Local Iteration #1 at bus -2 :
 
1  P2 - j Q2 (1,2) 
V2(2,1)    Y21. V1  Y23. V 
Y22  V(1,2) *
3 
 2 

1  - 0.6  j 0.3 
Or V2(2,1)    j.5 (10)  j.2.5 (0.835 11.980 )
- j7.5  (0.954  4.770 ) * 
 

Or V2 (2,1) = 0.890 - j.0.137 = 0.9008  - 8.7920 pu

Local Iteration #2 at bus -2 :


 
1  P2 - j Q 2 
V2(2,2)   Y21. V1  Y23. V (1,2) 
Y22 
 V (2,1) * 3 
 2 

(2,2) 1  - 0.6  j 0.3 0



Or V2   j.5 (10)  j.2.5 (0.835  11.98 )
- j7.5  (0.9008  8.7920 ) * 
 

Or V2 (2,2) = 0.8814 - j.0.138 = 0.892  - 8.890 pu

19
Gauss – Seidal Method Contd …..

Local Iteration #1 at bus -3 :


 
1  P3 - j Q3 (2,2) 
V3(2,1)    Y31. V1  Y32. V 
Y33  V (1,2) * 2 
 3 

1  -1  j 0.75 
Or V3(2,1)   j.4 (10)  j.2.5 (0.892   8.89 0 )
- j6.5  (0.835 11.980 ) * 
 

Or V3 (2,1) = 0.781 - j.0.203 = 0.8069  - 14.50 pu

Local Iteration #2 at bus -3 :


 
1  P3 - j Q3 
V3(2,2)    Y31. V1  Y32. V (2,2) 
Y33  V (2,1)* 2 
 3 

1  - 1  j 0.75 
Or V3(2,2)   j.4 (10)  j.2.5 (0.892  8.890 )
- j6.5  (0.8069  14.50 ) * 
 

Or V3 (2,2) = 0.7682 - j.0.202 = 0.794  - 14.720 pu

This is the end of Main iteration #2. The output from the main iteration#2 are :

V2 (2,2) = 0.8814 - j.0.138 = 0.892  - 8.890 pu


V3 (2,2) = 0.7682 - j.0.202 = 0.794  - 14.720 pu

20
Gauss – Seidal Method Contd …..

Let the pre-assigned accuracy is 0.1%, (i.e. V = 0.001 and  = 0.001 )

Here,
| V2 (2,2) - V2 (2,1) | = | 0.8926 - 0.9008 | = 0.0074

|2(2,2) - 2(2,1) | = | 8.89 - 8.87 | = 0.1

| V3 (2,2) - V3 (2,1) | = | 0.794 - 0.806 | = 0.012

|2(2,2) - 2(2,1) | = | 14.72 - 14.5 | = 0.22

Stop the iteration at nth iteration if,


| V2 (n) - V2 (n-1) | < V
|2(n) - 2(n-1) | < 
| V3 (n) - V3 (n-1) | < V
|3(n) - 3(n-1) | < 

21
Gauss – Seidal Method Contd …..

Accounting the Generator Bus :


In the above example, we had only reference bus and load buses. If there are voltage controlled
generator buses, the procedure of Gauss-Seidal method shall be modified as follow :
In the generator bus, voltage and active power generation are specified and Q and  have to be
determined.
If Kth bus is a generator bus, then
P - j Qk n
Ik  k  Yk1 V1 + Yk2 V2 + ............... + YKn Vn   Ykn . Vn
Vk* n1
 n 
Or Pk - j Qk  Vk*   Ykn . Vn 
n1
  
Equating active and reactive parts,
  n 
QK  - Im_part Vk*   Ykn . Vn   ............ (1)

 n 1  

Once we calculate QK, then we can calculate VK
 
1  Pk - j Q k
VK    Yk1 V1  Yk2 V2  ...............  Ykn Vn  ......... (2)
Ykk
 Vk* 

22
Gauss – Seidal Method Contd …..

Start with initial guess of K(0) = 00

i.e. VK (0) = | VK | specified  K(0)

Estimate QK(0) from equation (1). Use this value in eqn ( 2) to obtain a better estimate
of VK (Say VK (1) )

Then VK (1) = | VK (1)|  K(1)

Since VK will not change in generator bus, make correction as :

VK (1) corrected = | VK | specified  K(1)

The rest of the procedure will be same as before.

23
Gauss – Seidal Method Contd …..

Example :
Let us consider a three bus system as follow :

| V1 | 1 = 1 | 00 (Given)

Bus-2 (Generator Bus)


Bus-1 (Ref Bus)
y12 = -j 5.0 pu
P2 = 0.6 pu
y23 = -j 2.5 pu V2 = 1.0 pu
y13 = -j 4pu Q2 = ? , 2 = ?
Bus-3 (Load bus )

P2 =1 pu,
Q2 = 0.75 pu
|V3| = ?, 3 = ?

24
Gauss – Seidal Method Contd …..
.

Y11 Y12 Y13 -j 9 j5 j4

Ybus = Y21 Y22 Y2 = j5 -j 7.5 j 2.5

Y31 Y32 Y33 j4 j 2.5 - j6.5

Initial Guess : V2 (0) = | V2 | sp  0 = 1 0 and V3 (0) = 1 0


Main Iteration #1 :

Local iteration #1 at bus-2 :


Q2 (1,1) = - Impart { V2 (0) * [ Y21 V1 + Y22 V2 (0) + Y23 V3 (0) ] }
Or Q2 (1,1) = - Impart { (1 0 )* [ (j 5). (1 0) + (- j 7.5).( 1 0) + (j 2.5).( 1 0)] }
Or Q2 (1,1) = - Impart { (1 [ j 5 - j 7.5 + j 2.5] } = 0
 (1,1) 
1  P2 - j Q2 
Then, V2(1,1)   Y21 V1 - Y23 V3 ( 0 )
Y22  V (0) * 

 2 

1  0.6 - j 0.0 
Or V2(1,1)   (j 5). ( 100 )  ( j 2.5 ) ( 100 )   1.00324.50
- j 7.5  (100 ) * 
 

Or V2(1,1) Corrected = 1.0 4.570

25
Gauss – Seidal Method Contd …..

Local Iteration #2 at bus -2 :

Q2 (1,2) = - Impart { V2 (1,1) * [ Y21 V1 + Y22 V2 (1,2) + Y23 V3 (0) ] }

Or Q2 (1,2) = - Impart{(1 -4.570)[ (j 5).(10) + (- j 7.5).( 1 4.570) + (j 2.5).( 1 0)]}

Or Q2 (1,2) = - Impart { 0.596 - j 0.0237 } = 0.0237 pu , then

 (1,2) 
1  P2 - j Q2 
V2(1,2)    Y21 V1 - Y23 V3 ( 0 ) 
Y22  V (1,1) * 
 2 

(1,2) 1  0.6 - j 0.0237 


Or V2   (j 5). ( 10 )  ( j 2.5 ) ( 10 )   0.9994.750
0 0
- j7.5  (1 - 4.57 ) *
0 
 

Or V2(1,2) Corrected = 1.0 4.750

26
Gauss – Seidal Method Contd …..

Local Iteration # 1 at bus - 3 :


 
1  P3 - j Q3 
V3(1,1)   Y31 V1 - Y32 V2 ( 1,2 )
Y33  V (0) * 

 3 

1  -1.0  j 0.75 
Or V3(1,1)    (j 4). ( 10 0 )  ( j 2.5 ) ( 14.75 0 )   0.89   7.8 0
- j6.5  (100 ) * 
 

Local Iteration # 2 at bus - 3 :


 
1  P3 - j Q3 
V3(1,2)    Y31 V1 - Y32 V2 ( 1,2 ) 
Y33  V (1,1)* 
 3 

1  - 1.0  j 0.75 
Or V3(1,2)   (j 4). ( 100 )  ( j 2.5 ) ( 14.750 )   0.747 - 11.80
- j6.5  (0.89  7.80 ) * 
 

End of Main Iteration # 1


Out puts are : Q2 (1) = 0.0237 pu, V2 (1) = 1.0 4.750, V3 (1) = 0.747 -11.860
These values shall be used as initial values for Main Iteration #2 .
We shall repeat many main iterations up to nth iteration and shall be terminated when
| Q2 (n) - Q2 (n-1) | < Q
| V2 (n) - V2 (n-1) | < V | 2 (n) - 2 (n-1) | < 
| V3 (n) - V3 (n-1) | < V | 3 (n) - 3 (n-1) | < 

27

You might also like