Solving the

Power Flow Equations Power Flow Equations

Using the N-R method
2005 Badrul Chowdhury
Power Flow Solutions
T k i b Take a generic bus:
S P jQ = +
G G G
V o
S P j Q +
Each bus has six quantities or variables associated with it:
S P j Q = +
P D D
. , , , , ,
D D G G
Q P Q P V o
Assuming there are n buses in the system Assuming there are n buses in the system,
there would be 6n variables!
2005 Badrul Chowdhury
2
What are the Power Flow Equations?
The PF equations are:
n
*
1
*

1, 2, , .

Real 1 2
n
i i i ij j
j
n
P jQ V Y V i n
P V Y V i n
=
= =
(
= =
(

1
*
Real 1, 2, , .

-Imag 1, 2, ,
i i ij j
j
n
i i ij j
P V Y V i n
Q V Y V i n
=
= =
(

(
= =
(

1 j =

There are 2n equations and 6n variables.
Thus 4n variables have to be pre-specified!
See the supplemental document Developing_PFE.pdf for
2005 Badrul Chowdhury
3
derivation of the PFE
Bus Classification
Bus Class Pre-Spec Var Unknow var
Slack/swing
D D
Q P V , , , o
G G
Q P ,

|V|-cont. D D G
Q P P V , , ,

G
Q , o

Load
, , ,
G G D D
P Q P Q
o , V


2005 Badrul Chowdhury
4

Newton-Raphson Newton-Raphson
Method for Solution of Power Flow
Equations
2005 Badrul Chowdhury
Newtons Method
Taylor series expansion of a function f(x) of a
single variable, x around the point (x a) is given by:
( )
n
n
n n
a
a
x
f
n
a x
x
f a x
x
f
a x a f x f 9 +
c
c
+ +
c
c
+
c
c
+ =
!
) (
! 2
) ( ) ( ) (
2
2 2

a
a
Where: =
c
c
a
x
f
value of the derivative evaluated at x=a
(1)
c
a
x
The series converges if
0 = 9
n
n
Lim
If (x a) << 1 then we can neglect the higher order terms
f c
2005 Badrul Chowdhury
6
a
x
f
a x a f x f
c
c
+ ~ ) ( ) ( ) ( Then,
(2)
Newtons Method, contd.
L h f i b f( ) 0 Fi d h f f( ) Let the function be f(x)=0. Find the roots of f(x)
Initial guess: x
(0)
=a
( )
) 0 ( ) 0 (
0 ) (
f
x x f x f
c
A +
f
a x a f x f
c
+ ~ ) ( ) ( ) ( Since
(3)
( )
) 0 (
) ( ) (
0 ) (
x
x
f
x x f x f
c
A + = =
a
x
a x a f x f
c
+ ~ ) ( ) ( ) ( Since,
( )
0
) 0 (
f
x f
x
c
= A
) 0 (
x
x
f
c
c
(4)
Si
(1) (0)
+ A
(0)
( )
Since, x
(1)
= x
(0)
+ Ax
(0)
(5)
( )
) 0 (
0
) 0 ( ) 1 (
f
x f
x x
c
c
= (6)
2005 Badrul Chowdhury
7
) 0 (
x
x c
Newtons Method, contd.
Graphical interpretation of Eq. (5):
f x ( )
0
R t R t
f x ( )
x
1
B
Root Root
x
2
x
1
x = a
0
A
x
x
2
2005 Badrul Chowdhury
8
Taylor Series (Multiple variables - n)
L t th f ti b f( ) 0 Let the function be f(x
1
, x
2
, , x
n
)=0.
Expanding around the point
( ) ( ) ( ) ( ) ( ) ( ) ( ) ( ) n k a x a x a x a x
k k n n
, , 2 , 1 and 1 with , ,
2 2 1 1
= <<
Equation (1) becomes:
( ) ( ) ( ) ( )
2
2 2
1
1 1 2 1 2 1
, , , , , ,
n n
x
f
a x
x
f
a x a a a f x x x f
c
c
+
c
c
+ ~
Equation (1) becomes:
2 1
2 1
a a
x x c c
( )
n
n n
x
f
a x
c
c
+ +
(7)
n
a
n
x c
2005 Badrul Chowdhury
9
Taylor Series (Multiple variables and set of Equations)
C id t f li ti Consider a set of non-linear equations:
( )
( ) f
y x x x f
n
, , ,
1 2 1 1
=
( ) y x x x f
n
, , ,
2 2 1 2

=
(8)
( )
( ) n k y x x x f
y x x x f
k n k
n n n
, , 2 , 1 , , , or
, , ,
2 1
2 1

= =
=
Assume initial guesses x
k
(0)
and some correction Ax
k
Thus, x
k
(1)
= x
k
(0)
+ Ax
k (0)
(9)
2005 Badrul Chowdhury
10
Taylor Series Expansion
Approximate Taylors series after neglecting higher order terms: pp y g g g
(9)
( ) ( ) . , , , , , ,
) 0 (
2 1
1
1
) 0 ( ) 0 ( ) 0 (
2 1
+
c
c
A + =
x
k
n k n k
x
f
x x x x f x x x f
(9)
) (
1
1
x
. ..., , 2 , 1
) 0 ( ) 0 (
2
2
n k y
x
f
x
x
f
x
k
x
n
k
n
x
k
= =
c
c
A + +
c
c
A
) ( ) (
2
2
x
n
x
n
2005 Badrul Chowdhury
11
Taylor Series Expansion
Approximate Taylors series after neglecting higher order terms:
(
A
( c c c
x
f f f
1
( )
( ) (
(
(
(
(

A
A
(
(
(
(

c c c
c
c
c
c
c
c
(
(

x
n
x x
n
x
x
f f f
x
f
x
f
x
f
x x x f y
n


2
1
1
2
1
1
1
) 0 ( ) 0 ( ) 0 (
) 0 ( ) 0 (
2
) 0 (
1 1 1
) 0 ( ) 0 (
2
) 0 (
1
, , ,
( )
( )
(
(
(
(

(
(
(
(
(

c
c
c
c
c
c
=
(
(
(
(
(

x
n
x x
n
x
f
x
f
x
f
f
x x x f y
n

2
2
2
1
2
) 0 ( ) 0 ( ) 0 (
) 0 ( ) 0 (
2
) 0 (
1 2 2
) 0 ( ) 0 (
2
) 0 (
1
, , ,
( )
(
(
(

A
(
(
(

c
c
c
c
c
c
(

n
x
n
n
x
n
x
n
n n n
x
x
f
x
f
x
f
x x x f y
n

2 1
) 0 ( ) 0 (
2
) 0 (
1
) 0 ( ) 0 (
2
) 0 (
1
, , ,
(10)
2005 Badrul Chowdhury
12
Taylor Series Expansion, contd.
In matrix form:
(11)
| | | | | |
) 0 ( ) 0 ( ) 0 (
or X J K A =
(11)
| | | | | |
Where [ J ] is called the Jacobian matrix. Superscript (0) means
evaluation at the zeroth iteration.
| | | | ( ) | |
) 0 (
1
) 0 (
X K J

= A
(12)
To continue iteration, find :
| | | | | | | |
(1) (1) (0) (0)
from X X X X = + A
(13)
| | | | | | | | o
Generally,
| | | | | |
) ( ) ( ) 1 ( i i i
X X X A + =
+
(13)
(14)
2005 Badrul Chowdhury
13
where i is the iteration number
Newton-Raphson Method
Eqs. (12) and (14) are the essence of the Newton-Raphson method.
The power flow equations are:
(15)
( )
n i
f y V V P
n
n
k
ip ik i k ik k i i
, , 1
cos
1
=

= + =
=
o o
(15)
( ) f y V V Q
n
k
iq ik i k ik k i i
, ,
sin
1

)
`
= + =
=
o o
There are 2n equations present and 6n variables! There are 2n equations present and 6n variables!
Assume temporarily that all buses, except bus 1, are Load buses
V V

k i bl h ( ) l h
n
V V , ,
2
Unknown variables are the (n-1) voltage phasors:
2005 Badrul Chowdhury
14
Newton-Raphson Method
In terms of real variables, these are:
variables ) 1 ( , , , Angles
3 2
n
n
o o o
variables ) 1 ( , , , Magnitudes
) ( , , , g
3 2
3 2
n V V V
n
n

Take care of the voltage-controlled buses later in the algorithm !!
2005 Badrul Chowdhury
15
Newton-Raphson Method
Eq (12) can be written for the power flow equations as such: Eq. (12) can be written for the power flow equations as such:
(0) (0) (0) (0) (0)
2 2 2 2 2
2 3 2
(0) (0) (0) (0) (0)
p p p p p
n n
f f f f f
V V o o o
c c c c c
c c c c c

(
(
(
(
(
(0)
2
(0)
P ( A
(
(
(
(0)
2
o ( A
(
(
(
(0) (0) (0) (0) (0)
3 3 3 3 3
2 3 2
(0) (0) (0) (0) (0)
p p p p p
n n
f f f f f
V V o o o
c c c c c
c c c c c


(
(
(
(
(
(
(0)
3
P
(
A
(
(
(
(
(

(0)
3
o
(
A
(
(
(
(
(

(0) (0) (0) (0) (0)

2 3 2
(0) (0) (0)
2 2 2 2
np np np np np
n n
q q q q
f f f f f
V V
f f f f
o o o
c c c c c
c c c c c
=
c c c c

(0) (0)
2q
f
(
(
(
(
(
c
(
(

(16)
(0)
(0)
n
P
Q
(
(
A
(
(
(
( A
(0)
(0)
2
n
V
o
(
A
(
(
(
A
(
(
2 3 n
o o o c c c c
2 2
(0) (0) (0) (0) (0)
3 3 3 3 3
2 3 2
q q q q q
n n
V V
f f f f f
V V o o o
c (
(
( c c c c c
(
c c c c c
(
(

2
(0)
3
Q
Q
( A
(
(
(
A
(
(
(
(0)
3
V
(
(
(
A
(
(
(
(0) (0) (0) (0) (0)
2 3 2
nq nq nq nq nq
n n
f f f f f
V V o o o
(
(
(
c c c c c
(
( c c c c c
(



(0)
n
Q
(
(
(
(
A ( (

(0)
n
V
(
(
(
(
A (
(

2005 Badrul Chowdhury

16
n (

( )
1
cos
n
ip i i k ik k i ik
k
f P V V y o o
=
= = +

( )
1
sin
n
iq i i k ik k i ik
k
f Q V V y o o
=
= = +
1, , i n =
Newton-Raphson Method
Alternate form of Eq (16) Alternate form of Eq. (16)
(0) (0) (0) (0) (0)
2 2 2 2 2
2
2 3 2
(0) (0)
p p p p p
n
n n
f f f f f
V V
V V o o o
c c c c c
c c c c c

(
(
(
(
(0)
2
o ( A
(
(
(
(0)
2
P ( A
(
(
(
(0) (0) (0) (0) (0)
3 3 3 3 3
2
2 3 2
p p p p p
n
n n
f f f f f
V V
V V o o o
c c c c c
c c c c c


(
(
(
(
(
(
(
(0)
3
o
(
(
A (
(
(
(
(

(0)
3
P
(
(
A (
(
(
( (0) (0) (0) (0) (0)
2
2 3 2
(0) (0)
2 2 2
np np np np np
n
n n
f f f f f
V V
V V
f f f
o o o
c c c c c
c c c c c
=
c c c

(0) (0) (0)
2 2
f f
(
(
(
(
(
(
c c
(
(16b)
(0)
n
o
(
(
(
A
(
(
(
(0)
(0)
n
P
Q
(
(
A
(
(
(
( A

2 2 2
2 3
q q
f f f
o o
c c c
c c

2 2
2
2
(0) (0) (0) (0) (0)
3 3 3 3 3
2
q q q
n
n n
q q q q q
n
f f
V V
V V
f f f f f
V V
V V
o
o o o
c c
(
c c c (
(
( c c c c c
(
c c c c c
(

(0)
2
2
(0)
3
V
V
V
(
A (
(
(
(
A
(
(
(0)
2
(0)
3
Q
Q
( A
(
(
(
A
(
(
2 3 2
(0) (0) (0) (0) (0)
2
n n
nq nq nq nq nq
n
V V
f f f f f
V V
V V
o o o
o o o
c c c c c
(
(

c c c c c

c c c c c

(
(
(
(
(
3
(0)
n
V
V
V
(
(
(
(
A
(
(
(

(0)
Q
(
(
(
(
(
A ( (

2005 Badrul Chowdhury

17
2
2 3 2
n
n n
V V o o o c c c c c

(
( n
V
(
(

n
Q A ( (
Newton-Raphson Method
2
i
i i ii
P
Q V B
o
c
=
c
( ) sin
i
i k ik k i ik
P
V V y o o
o
c
= +
c
J
11
Off-diagonal
Diagonal
(9.54)
i i ii
i
Q
o c
( )
i k ik k i ik
k
y
o c
i i
P Q
V
c c
=
11
J
2
i
P
V P V G
c
= +
(9.52)
( )
(9 61) k
k k
V
V o
=
c c
J
12
i i i ii
i
V P V G
V
= +
c
Q c
Q c
(9.59) (9.61)
2
i
i i ii
i
Q
P V G
o
c
=
c
( ) cos
i
i k ik k i ik
k
Q
V V y o o
o
c
= +
c
J
21
Q c
(9.55)
(9.57)
i i
k
k k
Q P
V
V o
c c
=
c c
J
22
2
i
i i i ii
i
Q
V Q V B
V
c
=
c
(9.62) (9.63)
B i G
2005 Badrul Chowdhury
18
cos B sin
ii ii ii ii ii ii
G y y = =
Newton-Raphson Method, contd.
Th l i h i h The algorithm, in short:
Find J
(0)
, and AU
(0)
at the initial guesses
Find AX for the initial guesses from (17) Find AX for the initial guesses from (17)
Find X
(1)
for the next iteration from (18)
Continue until convergence is achieved. g
) 0 ( ) 0 ( ) 0 (
. X J U A = A
where:
(17)
where:
guesses intial at mismatches power of vector
) 0 (
= AU
guesses initial at the evalutated matrix Jacobian the
) 0 (
= J guesses initial at the evalutated matrix Jacobian the J
iteration zeroth at or error vect the
) 0 (
= AX
| | | | | |
) ( ) ( ) 1 ( i i i
X X X A + =
+
(18)
2005 Badrul Chowdhury
19
| | | | | | X X X A + =
(18)
Newton-Raphson Method Example
0 0 . 1

Given
o
1
Z = pu V
1
2 j0.5
6 . 0
0 . 1
2
2
1
=
=
pu P
pu V
p
j0.2 j0.25
6 . 0
8 . 0
3
3
2
=
=
Q
pu P
p
3
(
(
(

(
(
(

0
0
) 0 (
) 0 (
2
o
o
(
(

5 2 7 j j j
(
(
(
(

=
(
(
(
(
(

=
0 1
0 . 1
0
0
0
2
3 ) 0 (
V
X
o
(
(
(

=
9 4 5
4 6 2
j j j
j j j Y
bus
2005 Badrul Chowdhury
20
(

0 . 1 0
3
V
Newton-Raphson Method Example, contd.
( ) ( )
( )
22 2 2 2 2 22 21 2 1 1 2 21 2 2
cos
cos cos
o o
o o o o
+ +
+ + + = =
V V
V V y V V y f P
p
( )
23 2 3 3 2 23
cos o o + + V V y
( ) ( )
22 2 2 2 2 22 21 2 1 1 2 21 2 2
sin sin o o o o + + + = = V V y V V y f Q
q
( ) ( )
( )
23 2 3 3 2 23
22 2 2 2 2 22 21 2 1 1 2 21 2 2
sin
s s
o o
o o o o
+ + V V y
V V y V V y f Q
q
( ) ( )
2
21 1 2 2 21 23 2 3 2 3 23
sin sin
p
f
y V V y V V o o o
o
c
=
c
Start evaluating Jacobian entries:
( ) ( )
( )
1
21 1 2 2 21 23 2 3 2 3 23
0
2
2
23 2 3 3 2 23
sin
p
y y
f
y V V
o

o
o o
o
=
c
c
= +
c

2005 Badrul Chowdhury

21
3
o c
Newton-Raphson Method Example, contd.
( ) cos
23 2 3 2 23
3
2
+ =
c
c
V y
V
f
p
o o
0 4 6
guesses, initial At the
2
o
2
o
2
c c c

f f f
p p p
Also:
0 ; 4 ; 6
3 3 2
=
c
=
c
=
c V
p p p
o o
Also:
( ) ( )
( )
2
32 3 2 2 3 32 31 3 1 1 3 31 3 3
cos cos
o o
o o o o + + + = =
V
V V y V V y f P
p
( )
33 3 3
2
3 33
cos o o + + V y
( ) ( ) |
32 3 2 2 3 32 31 3 1 1 3 31 3 3
sin sin o o o o V V y V V y f Q
q
+ + + = =
2005 Badrul Chowdhury
22
|
23
2
3 33
sin V y +
Newton-Raphson Method Example, contd.
o
cf
( ) 4 sin
32 3 2 2 3 32
2
3
= + =
c
c
o o
o
V V y
f
p
( ) ( ) | sin sin
32 2 3 2 3 32 31 3 1 3 31
o
3
+ = c o o o V V y V V y f ( ) ( ) |
9
sin sin
32 2 3 2 3 32 31 3 1 3 31
3
3
=
+ =
c
c o o o
o
V V y V V y f
p
( ) ( ) | cos cos
32 3 2 2 32 31 3 1 1 31
o
3
+ + + = c o o o o V y V y f ( ) ( ) |
0 cos 2
cos cos
33 3 33
32 3 2 2 32 31 3 1 1 31
3
3
= +
+ + + =
c
c

o o o o
V y
V y V y
V
f
p
o
cf
( ) | | 0 cos
32 3 2 2 3 32
2
3
= + =
c
c
o o
o
V V y
f
q
( ) ( ) | | 0
o
3
c
o o o o V V V V
f
q
( ) ( ) | | 0 cos cos
32 2 3 2 3 32 31 1 3 1 3 31
2
3
= =
c
o o o o
o
V V y V V y
f
q
( ) ( ) | | sin 2 sin sin
33 3 33 32 3 2 2 32 31 3 1 1 31
o
3
+ + + + = c V y V y V y f
q
2005 Badrul Chowdhury
23
( ) ( ) | |
9
33 3 33 32 3 2 2 32 31 3 1 1 31
3
= c
y y y
V
q
Newton-Raphson Method Example, contd.
There is no need to evaluate
these, since they will be
3
2
3
2
2
2
2
2
, , ,
f
V
f
V
f f
q q q q
c
c
c
c
c
c
c
c
o o
these, since they will be
deleted from the Jacobian!
2
3
2
3
2
2
, ,
V
f
V
f
V
f
q p p
c
c
c
c c
(
A
(
(
A
2
0
2
0 0 4 6 P o
The equations to be solved are:
(
(
(
(
(

A
A
A
(
(
(
(

=
(
(
(
(
(

A
A
A
2
3
2
0
2
0
3
2
4 10 0 0
0 0 9
4
0 0 4 6
V Q
P
P
o
o
(
(

A
A
(
(
(

(
(

A
A
3
2
0
3
2
9 4 0 0
4 10 0 0
V
V
Q
Q
2005 Badrul Chowdhury
24
Newton-Raphson Method Example, contd.
The mismatch equations are:
( )( )( ) ( )( )( ) ( )( )( )
0 o o
2 2
0.6 and 2 1 1 cos(0 0 90) 6 1 1 cos( 90 ) 4 1 1 cos(0 0 90 )
0
S
P P = = + + + +
0 =
( )( )( ) ( )( )( ) ( )( )( )
0 o
3 3
0.8 and 5 1 1 cos90 4 1 1 cos90 9 1 1 cos( 90 )
S
P P = = + +
0 =
( )( )( ) ( )( )( ) ( )( )( )
0 o o
35 3
0.6 and 5 1 1 sin90 4 1 1 sin90 9 1 1 sin( 90 ) Q P = = + +
0 =
0
0
2 2 2
0.6
S
P P P A = =
0
3 3 3
- 0.8
S
P P P A = =
0
3 3 3
Q Q 0.6
S
Q A = =
2005 Badrul Chowdhury
25
3 3 3
Q Q 0.6
S
Q A
Newton-Raphson Method Example, contd.
The final equations are:
(
A
( (
o
(
(
(
(

A
A
(
(
(
(

=
(
(
(
(

3
2
0
4 10 0 0
0 0 9
4
0 0 4 6
8 . 0
6 . 0
Q
o
o
(
(
(

A
A
(
(
(

(
(

A
3
2
0
2
9 4 0 0
4 10 0 0
6 . 0
V
V
Q
6 by Divide 0 4 6 6 0
2
( A
(

(
o
Apply Gaussian elimination:
4 by Divide
6 by Divide
9 0 0
0 9 4
0 4 6
6 . 0
8 . 0
6 . 0
3
3
2
(
(
(

A
A
A
(
(
(

=
(
(
(

V
o
o
2005 Badrul Chowdhury
26
3
(

Newton-Raphson Method Example, contd.

1 row to row this Add 0 25 . 2 1
0 667 . 0 1
2 . 0
1 . 0
3
2
(
(
(
(

A
A
(
(
(

=
(
(
(

o
o
9 0 0 6 . 0
3
(
(

A (
(

(
(

V
0 667 . 0 1 1 . 0
2
(
(

A
(
(

(
(

o
1.583 by Divide
9 0 0
0 583 . 1 0
6 . 0
1 . 0
3
3
(
(
(

A
A
(
(
(

=
(
(
(

V
o
(
(
(

A
A
(
(
(

=
(
(
(

3
2
0 1 0
0 667 . 0 1
063 . 0
1 . 0
o
o
(
(

A (
(

(
(

3
9 0 0 6 . 0 V
2005 Badrul Chowdhury
27
Newton-Raphson Method Example, contd.
k b i i By Back Substitution:
067 . 0
9
6 . 0
3
= = AV
667 0 1 0
063 . 0
9
3 2
3
3
A + = A
= A
o o
o
058 . 0 058 . 0 0
058 . 0
667 . 0 1 . 0
2
3 2
= + =
=
A + = A
o
o o
2
3
) 0 (
3
) 1 (
3
A + = V V V
063 0 063 0 0
933 . 0
067 . 0 0 . 1
=
=
o
2005 Badrul Chowdhury
28
063 . 0 063 . 0 0
3
= = o
CONTINUE!
Newton-Raphson Method Example, contd.
i li fl Computing line flows:
V
^
V
^
y
I
s
i j
Bus j Bus i
^
y
s
s
I
ij
I
ji
I I
pj pi
^ ^
^
Y
pj Y
pi
Line current I
ij
at bus i is defined positive in the direction i -> j
( )
pi i s j i pi s ij
Y V Y V V I I I

+ = + =
(19)
2005 Badrul Chowdhury
29
Newton-Raphson Method Example, contd.
b li d fi d i i i h li Let S
ij
, S
ji
be line powers defined positive into the line:
(20) ( )
* 2 * * * *

pi i s j i i ij i ij ij ij
Y V Y V V V I V jQ P S + = = + = ( ) ( )
pi i s j i i ij i ij ij ij
jQ
( )
*
2
* * * *

pi j s i j j ji j ji ji ji
Y V Y V V V I V jQ P S + = = + = (21)
The total power loss in line i j is the algebraic sum of the power
flows determined from Eqns (20) and (21) flows determined from Eqns. (20) and (21).
ji ij Lij
S S S + =
(22)
j j j
2005 Badrul Chowdhury
30
Tap changing and phase-shifting transformers p g g p g
i j
Tap changing side
t l
V
i
V
j
1 : t
Used for small
t = real
Used for small
magnitude changes
V
i j
Phase changing side
Used for small real
power flow changes
V
i
V
j
1 : t | Z
t = complex
2005 Badrul Chowdhury
31
power flow changes
t complex
Tap changing transformers textbook version
I
i
I
j
t = complex
i j
V
i V
j
1 : t
t = complex
S
i
= V
i
I
i
*
; S
j
= tV
i
I
j
*
i i i j i j
Since S
i
= - S
j
Y
1 : t
I I
+
+
+
i
j
i j
I
i
= -t
*
I
j
I
j
= (V
j
-tV
i
)Y
= tYV +YV (a)
V
i
V
j
I
i
I
j
+
tV
i
= -tYV
i
+YV
j
(a)
-t
*
I
j
= -t
*
(-tYV
i
+YV
j
)
= t
*
tYV
i
- t
*
YV
j
* *
(b)
-
-
-
2005 Badrul Chowdhury
32
I
i
= t
*
tYV
i
- t
*
YV
j
(b)
Tap changing transformers textbook version
Y Y I V
i j
|t|
2
Y t
*
Y I
V
i j
Y
ii
Y
ij
Y
ji
Y
jj
I
i
I
j
V
i
V
j
=
|t|
2
Y -t Y
-tY Y
I
i
I
j
V
i
V
j
=
tY
i j
+
( 1) (1 t)Y
+
V
i
V
j
t(t-1)Y (1-t)Y
2005 Badrul Chowdhury
33
-
-
Tap changers another version (use this)
I
i
i
j
V
i
V
j
Y
1 : t
I
j
t = complex p
Y
1 : t
I
i
I
j
+
+
+
i
j
V
i
V
j
+
+
V
j
/t
+
i
- -
-
2005 Badrul Chowdhury
34
Tap changing transformers in the Y
bus
p g g
bus
Y Y I V
i j
Y -Y/t I
V
i
i j
Y
ii
Y
ij
Y
ji
Y
jj
I
i
I
j
V
i
V
j
=
Y -Y/t
-Y/t
*
Y/|t|
2
I
i
I
j
V
i
V
j
=
Y/t
i j
+
V
(t-1)Y/t (1-t)Y/t
2
+
V
i
V
j
(t 1)Y/t (1 t)Y/t
2005 Badrul Chowdhury
35
- -
Example of a Tap Transformer
1
A tap transformer is placed
between Bus 3 and a new Bus 5.
1
2
Assume tap = 1.0375 and a
reactance of 0.02 pu. Transfer
the load fromBus 3 to Bus 5
3 4
Generation Load
Bus P, MW Q, Mvar P, MW Q, Mvar
pu V ,
o
1 50 30 99 1 0
O
the load from Bus 3 to Bus 5.
5
1 -- -- 50 30.99 1.0
0
O
2 0 0 170 105.35 -- --
3 0 0 0 0 -- --
4 318 -- 80 49.58 1.02 --
5 0 0 200 123.94 -- --

Line R, pu X, pu Y/2, pu
1 - 2 0.01008 0.0504 0.05125
1 3 0.00744 0.0372 0.02875
2 4 0 00744 0 0372 0 03875
2005 Badrul Chowdhury
36
2 4 0.00744 0.0372 0.03875
3 4 0.01272 0.06360 0.06375
5 3 0.0 0.02 0.0

Bus 5 is the tap side
Change in the Y
bus
due to Tap Transformer
Y/t
0 0 0 0 0 (
1
1 2 3 4 5
3 5
(t-1)Y/t
(1-t)Y/t
2
0 0 0 0 0
0 0 0 0 0
0 0 49.99 0 j48.19
0 0 0 0 0
Bus
Y j
(
(
(
( A =
(
(
1
2
3
4
Y/t = (t 1)Y/t = (1 t)Y/t
2
0 0 0 0 0
0 0 48.19 0 -j46.45 j
(
(

4
5
Y/t =
(1/j0.02)/1.0375
= -j48.19
(t-1)Y/t =
0.0375*(1/j0.02)/1.0375
= -j1.8
(1-t)Y/t
2
=
-0.0375*(1/j0.02)/1.0375
2
=
j1.74
2005 Badrul Chowdhury
37
Change in the Y
bus
due to Tap Transformer
Old Y
Bus
(
+ + 0 85 25 17 5 08 19 816 3 836 44 98 8 j j j
1
1
2 3 4
(
(
(
(

+ +
+ +
+ +
=
86 40 193 8 12 1 024 3 8 2 1 0
12 . 15 02 . 3 86 . 40 1933 . 8 0 85 . 25 1696 . 5
85 . 25 17 . 5 0 84 . 44 985 . 8 08 . 19 82 . 3
0 85 . 25 17 . 5 08 . 19 816 . 3 836 . 44 98 . 8
j j j
j j j
j j j
Y
Bus
1
2
3
4
NewY
(

+ + 86 . 40 193 . 8 12 . 15 024 . 3 85 . 25 17 . 5 0 j j j
4
New Y
Bus
8.98 44.836 3.816 19.08 5.17 25.85 0 0
3.82 19.08 8.985 44.84 0 5.17 25.85 0
j j j
j j j
+ +
+ +
(
(
(
5
1
2
3
4
1
2
3.8 9.08 8.985 .8 0 5. 7 5.85 0
5.1696 25.85 0 8.1933 90.86 3.02 15.12 j48.19
0 5.17 25.85 3.024
0 0
Bus
j j j
Y j j j
j
= + +
+ + 15.12 8.193 40.86 0
48.19 0 -j46.45
j j
j
(
(
(

(
(
5
2
3
4
2005 Badrul Chowdhury
38
0 0 48.19 0 j46.45 j
5
Using the PowerWorld Software
Start building a simple power system from
scratch scratch
Run a N-R power flow solution algorithm
Perform power flow studies
2005 Badrul Chowdhury
39