Electrical Microgrids Design Session 3 Power Flows: Luis Ismael Minchala Avila

Electrical microgrids design
Session 3
Power flows
Luis Ismael Minchala Avila
Universidad de Cuenca
Departamento de Elctrica, Electrnica y Telecomunicaciones
ismael.minchala@ucuenca.edu.ec
Ismael Minchala A. (UCuenca)
Power flows
April 15th, 2015
1 / 52
Agenda
1
Introduction
Gauss elimination
Jacobi and Gauss-Seidel
Newton-Raphson
The power-flow problem
Control of power-flow problem
Summary and questions
Power flows
April 15th, 2015
2 / 52
Introduction
Introduction
Successful power system operation under normal balanced three-phase

steady-state conditions requires the following:
Generation supplies the demand (load) plus losses.
Bus voltage magnitudes remain close to rated values.
Generators operate within specified real and reactive power limits.
Transmission lines and transformers are not overloaded
The power-flow (PF) computer program (sometimes called load flow) is the
basic tool for investigating these requirements.
Power flows
April 15th, 2015
3 / 52
Introduction
Introduction
Successful power system operation under normal balanced three-phase

steady-state conditions requires the following:
Generation supplies the demand (load) plus losses.
Bus voltage magnitudes remain close to rated values.
Generators operate within specified real and reactive power limits.
Transmission lines and transformers are not overloaded
The power-flow (PF) computer program (sometimes called load flow) is the
basic tool for investigating these requirements.
Power flows
April 15th, 2015
3 / 52
Introduction
Introduction
The PF program computes the voltage magnitude and angle at each

bus in a power system under balanced three-phase steady-state
conditions.
It also computes real and reactive power flows for all equipment
interconnecting the buses, as well as equipment losses.
The PF problem is formulated as a set of nonlinear algebraic equations
suitable for computer solution.
Power flows
April 15th, 2015
4 / 52
Introduction
Characteristics of WTG for WPP
Wind turbine generators (WTG) have developed from small machines

with output power ratings on the order of kilowatts to several
megawatts.
The principle of wind turbine (WT) operation is based on two
well-known processes.
The conversion of kinetic energy of moving air into mechanical energy.
This is accomplished by using aerodynamic rotor blades and a variety
of methodologies for mechanical power control.
2 The electromechanical energy conversion through a generator that is
transmitted to the electrical grid.
1
Power flows
April 15th, 2015
5 / 52
Introduction
Characteristics of WTG for WPP

WTs can be classified by their mechanical power control, and further
divided by their speed control.
At the top level turbines can be classified as either stall regulated or
pitch regulated.
Stall regulation is achieved by shaping the turbine blades such that the
airfoil generates less aerodynamic force at high wind speed..
2 Pitch regulation is achieved through the use of pitching devices in the
turbine hub, which twist the blades around their own axes.
1
WTs are further divided into fixed speed (Type 1), limited variable
speed (Type 2), or variable speed with either partial (Type 3) or full
(Type 4) power electronic conversion. In a Type 5 WT the mechanical
torque converter between the rotors shaft and the generators shaft
controls the generator speed to the electrical synchronous speed.
Power flows
April 15th, 2015
6 / 52
Introduction
Type 1 WTG: Limited Variable Speed
Squirrel-cage Induction Generator (SCIG) connected directly to the

step up transformer.
The turbine speed is fixed (or nearly fixed) to the electrical grid
frequency.
It generates real power (P) when the turbine shaft rotates faster than
the electrical grid frequency creating a negative slip (positive slip and
power is motoring convention).
For a given wind speed, the operating speed of the turbine under
steady conditions is a nearly linear function of torque.
For sudden changes in wind speed, the mechanical inertia of the drive
train will limit the rate of change in electrical output
Power flows
April 15th, 2015
7 / 52
Introduction
Power flows
April 15th, 2015
8 / 52
Introduction
Wound rotor induction generators are connected directly to the WTG

step-up transformer in a fashion similar to Type 1 with regards to the
machines stator circuit, but also include a variable resistor in the rotor
circuit.
This can be accomplished with a set of resistors and power electronics
external to the rotor with currents flowing between the resistors and
rotor via slip rings.
The variable resistors are connected into the rotor circuit softly and
can control the rotor currents quite rapidly so as to keep constant
power even during gusting conditions, and can influence the machines
dynamic response during grid disturbances.
Power flows
April 15th, 2015
9 / 52
Introduction
Power flows
April 15th, 2015
10 / 52
Introduction
Type 3: Variable speed partial power electronics conversion
Known commonly as the doubly fed induction generator (DFIG) or

doubly fed asynchronous generator (DFAG), takes the Type 2 design
to the next level, by adding variable frequency ac excitation (instead of
simply resistance) to the rotor circuit.
The additional rotor excitation is supplied via slip rings by a current
regulated, voltage-source converter, which can adjust the rotor
currents magnitude and phase nearly instantaneously.
This rotor-side converter is connected back-to-back with a grid side
converter, which exchanges power directly with the grid.
Power flows
April 15th, 2015
11 / 52
Introduction
Type 4: Variable speed with full power electronics conversion

Offers a great deal of flexibility in design and operation as the output
of the rotating machine is sent to the grid through a full-scale
back-to-back frequency converter.
The turbine is allowed to rotate at its optimal aerodynamic speed,
resulting in a wild ac output from the machine.
In addition, the gearbox may be eliminated, such that the machine
spins at the slow turbine speed and generates an electrical frequency
well below that of the grid.
Power flows
April 15th, 2015
12 / 52
Introduction
Type 5 WTG
Consist of a typical WTG variable-speed drive train connected to a
torque/speed converter coupled with a synchronous generator (SG).
The closely coupled SG, operating at a fixed speed can then be
directly connected to the grid through a synchronizing circuit breaker.
The SG can be designed appropriately for any desired speed (typically
6 pole or 4 pole) and voltage.
This approach requires speed and torque control of the torque/speed
converter along with the AVR, synchronizing system, and generator
protection system inherent with a grid-connected SG.
Power flows
April 15th, 2015
13 / 52
Introduction
Voltage control capabilities
The voltage control capabilities of a WTG depend on the wind turbine

type.
Type 1 and Type 2 WTGs can typically not control voltage. Instead,
these WTGs typically use power factor correction capacitors (PFCCs)
to maintain the power factor or reactive power output on the low
voltage terminals of the machine to a setpoint.
Types 3 through 5 WTGs can control voltage. These WTGs are
capable of varying the reactive power at a given active power and
terminal voltage, which enables voltage control
Power flows
April 15th, 2015
14 / 52
Gauss elimination
Solutions to LAE: Gauss elimination

Lets consider:
A11
A21
..
.
A12
A22
..
.
...
...
..
.
A1N
A2N
..
.
AN1 AN2 . . .
ANN
x1
x2
..
.
y1
y2
..
.
(1)
yN
xN
Ax = y
If A is an upper triangular matrix with nonzero diagonal elements, we have:
A11 A12 . . .
0 A22 . . .
..
..
..
.
.
.
0
0 ...
A1,N1
A2,N1
..
.
A1N
A2N
..
.
ANN
Power flows
x1
x2
..
.
xN
y1
y2
..
.
(2)
yN
April 15th, 2015
15 / 52
Gauss elimination
Solutions to LAE: Gauss elimination

Lets consider:
A11
A21
..
.
A12
A22
..
.
...
...
..
.
A1N
A2N
..
.
AN1 AN2 . . .
ANN
x1
x2
..
.
y1
y2
..
.
(1)
yN
xN
Ax = y
If A is an upper triangular matrix with nonzero diagonal elements, we have:
A11 A12 . . .
0 A22 . . .
..
..
..
.
.
.
0
0 ...
A1,N1
A2,N1
..
.
A1N
A2N
..
.
ANN
Power flows
x1
x2
..
.
xN
y1
y2
..
.
(2)
yN
April 15th, 2015
15 / 52
Gauss elimination
Back substitution
xN
xN1 =
xk
yN
ANN
yN1 AN1,N xN
AN1,N1
P
yk N
n=k+1 Akn xn
Akk
Power flows
(3)
April 15th, 2015
16 / 52
Gauss elimination
Gauss elimination
A11
..
.
A12

A22
A21
A11 A12
...
..
..
.
.

A21
...
AN2 A11 A12
A1N
...

A2N
A21
A11 A1N
..
.

ANN
A21
A11 A1N
x1
x2
..
.
xN
y1
A21
y1
y2 A
11
..
.
y1
yN AAN1
11
(4)
(2)
A11
0
..
.
0
(2)
A12
(2)
A22
..
.
0
...
...
..
.
(2)
A1N
(2)
A2N
...
ANN
Power flows
..
.
(2)
x1
x2
..
.
xN
y1
y2(2)
..
.
(2)
yN
April 15th, 2015
(5)
17 / 52
Gauss elimination
Example: Gauss elimination and back substitution

Solve using Gauss elimination and back substitution:

10 5
x1
6
2 9
x2
3
Solution:

10
5
2
0 9 10
5

6
6
=
2
2
3 10
6
3 10
6

10 5
x1
6
6
=
0 8
x2
8
1.8
x1
x2

(1)
x2 =
(1)
x1 =
(1)
y1 A12 x2
(1)
A11
y2
(1)
A22
1.8
= 0.225
8
6 (5)(0.225)
= 0.4875
10
Power flows
April 15th, 2015
18 / 52
Gauss elimination
Example: Gauss elimination and back substitution

Solve using Gauss elimination and back substitution:

10 5
x1
6
2 9
x2
3
Solution:

10
5
2
0 9 10
5

6
6
=
2
2
3 10
6
3 10
6

10 5
x1
6
6
=
0 8
x2
8
1.8
x1
x2

(1)
x2 =
(1)
x1 =
(1)
y1 A12 x2
(1)
A11
y2
(1)
A22
1.8
= 0.225
8
6 (5)(0.225)
= 0.4875
10
Power flows
April 15th, 2015
18 / 52
Gauss elimination
Exercise: Triangularizing a matrix
Use Gauss elimination to triagularize:

5
2 3 1
x1
4 6
7
8
x2
9
10 12 14
x3
Power flows
April 15th, 2015
19 / 52
Iterative solutions to LAE
A general iterative solution to (1) proceeds as follows:

1
Select an initial guess x(0)
x(i + 1) = g[x(i)] i = 0, 1, 2, . . .

k (i)
Continue until xk (i+1)x
<
xk (i)
x(i) is the ith guess, g is an N vector of functions that specify the iteration
method, and is a specified tolerance.
Power flows
April 15th, 2015
20 / 52
The Jacobi method
yk = Ak1 x1 + Ak2 x2 + + Akk xk + + AkN xN

(6)
1
[yk (Ak1 x1 + + Ak,k1 xk1 + Ak,k+1 xk+1 + + AkN xN )]
xk =
Akk
"
#
k1
N
X
X
1
xk =
yk
Akn xn
Akn xn
(7)
Akk
n=1
n=k+1
The Jacobi method uses the old values of x(i) at iteration i to generate the new
value of xk (i + 1). That is:
"
#
k1
N
X
X
1
yk
Akn xn (i)
Akn xn (i)
xk (i + 1) =
Akk
n=1
k = 1, 2, . . . , N (8)
n=k+1
Power flows
April 15th, 2015
21 / 52
The Jacobi method
yk = Ak1 x1 + Ak2 x2 + + Akk xk + + AkN xN

(6)
1
[yk (Ak1 x1 + + Ak,k1 xk1 + Ak,k+1 xk+1 + + AkN xN )]
xk =
Akk
"
#
k1
N
X
X
1
xk =
yk
Akn xn
Akn xn
(7)
Akk
n=1
n=k+1
The Jacobi method uses the old values of x(i) at iteration i to generate the new
value of xk (i + 1). That is:
"
#
k1
N
X
X
1
xk (i + 1) =
yk
Akn xn (i)
Akn xn (i)
Akk
n=1
k = 1, 2, . . . , N (8)
n=k+1
Power flows
April 15th, 2015
21 / 52
The Jacobi method
x(i + 1) = Mx(i) + D1 y
M = D
D =
(9)
(D A)
A11 0
0 A22
..
0
.
..
..
.
.
0
0
Power flows
(10)
0 ...
0 ...
.. . .
.
.
.. . .
.
.
0 ...
0
0
..
.
0
ANN
April 15th, 2015
(11)
22 / 52
Example: Jacobi method

Solve using the the Jacobi method.

10 5
x1
6
2 9
x2
3
Following the methodology just presented, we have:

=
x1 (i + 1)
x2 (i + 1)

=
1
10
1
9

5
5
10
0 10
=
=
0 19
29
0
29
0

5
1
0 10
x1 (i)
6
0
=
+ 10 1
x2 (i)
3
29
0
0 9

M

1
10 0
0 9
1
10

Power flows
April 15th, 2015
23 / 52

Solve using the the Jacobi method.

10 5
x1
6
2 9
x2
3
Following the methodology just presented, we have:

=
x1 (i + 1)
x2 (i + 1)

=
1
10
1
9

5
5
10
0 10
=
=
0 19
29
0
29
0

5
1
0 10
x1 (i)
6
0
=
+ 10 1
x2 (i)
3
29
0
0 9

M

1
10 0
0 9
1
10

Power flows
April 15th, 2015
23 / 52

Starting with x1 (0) = 0 and x2 (0) = 0, the iterative solution is given in the
following table:
i
x1 (i)
x2 (i)
0
0
0
1
0.6000
0.3333
2
0.4333
0.2000
3
0.5000
0.2370
4
0.4814
0.2222
5
0.4888
0.2263
...
...
...
10
0.48749
0.22500
The convergence criterion is satisfied at the 10th iteration, since:

x1 (10) x1 (9)
0.48749 0.48752

=
= 6.2 105 <

x1 (9)
0.48749

x2 (10) x2 (9)

= 0.22500 0.22502 = 8.9 105 <

x2 (9)
0.22502
Power flows
April 15th, 2015
24 / 52

Starting with x1 (0) = 0 and x2 (0) = 0, the iterative solution is given in the
following table:
i
x1 (i)
x2 (i)
0
0
0
1
0.6000
0.3333
2
0.4333
0.2000
3
0.5000
0.2370
4
0.4814
0.2222
5
0.4888
0.2263
...
...
...
10
0.48749
0.22500
The convergence criterion is satisfied at the 10th iteration, since:

x1 (10) x1 (9)
0.48749 0.48752

=
= 6.2 105 <

x1 (9)
0.48749

x2 (10) x2 (9)

= 0.22500 0.22502 = 8.9 105 <

x2 (9)
0.22502
Power flows
April 15th, 2015
24 / 52
Newton-Raphson
Iterative solutions to NLAE: Newton-Raphson

Considering a set of nonlinear algebraic equations in matrix form:
f(x) =
f1 (x)
f2 (x)
..
.
=y
(12)
fN (x)
0 = y f(x)
Adding Dx to both sides of (12), where D is a square N N invertible
matrix,
Dx = Dx + y f(x)
x = x + D1 [y f(x)]
x(i + 1) = x(i) + D1 {y f[x(i)]}
Power flows
(13)
April 15th, 2015
25 / 52
Newton-Raphson

Considering a set of nonlinear algebraic equations in matrix form:
f(x) =
f1 (x)
f2 (x)
..
.
=y
(12)
fN (x)
0 = y f(x)
Adding Dx to both sides of (12), where D is a square N N invertible
matrix,
Dx = Dx + y f(x)
x = x + D1 [y f(x)]
x(i + 1) = x(i) + D1 {y f[x(i)]}
Power flows
(13)
April 15th, 2015
25 / 52
Newton-Raphson

One method for speciying D, called Newton-Raphson, is based on the
following Taylor series expansion of f(x) about an operating point x0 :

f
...
y = f(x0 ) +
x x=x0
"
#1
f
x = x0 +
(x x0 )
x x=x0
x(i + 1) = x(i) + J1 (i) (y f[x(i)])
f
f
J(i) =
f
=

x x=x(i)
..
.
...
...
..
.
fN
x2
...
fN
xN
x1
f2
x1
x2
f2
x2
fN
x1
..
.
Power flows
(14)
f1
xN
f2
xN
..
.
April 15th, 2015
(15)
26 / 52
Newton-Raphson
Example: Solution to polynomial equations

Solve the scalar equation f (x) = y , where y = 9 and f (x) = x 2 . Starting
with x(0) = 1, use the Newton-Raphson approach.

d
x 2 x=x(i) = 2x|x=x(i) = 2x(i)
dx

1
x(i + 1) = x(i) +
9 x 2 (i)
2x(i)
J(i) =
Starting with x(0) = 1, successive calculations of the NR equations gives:

i
x(i)
0
1
1
5.00000
2
3.40000
3
3.02353
Power flows
4
3.00009
5
3.00000
April 15th, 2015
27 / 52
Newton-Raphson
Example: Solution to polynomial equations

Solve the scalar equation f (x) = y , where y = 9 and f (x) = x 2 . Starting
with x(0) = 1, use the Newton-Raphson approach.

d
x 2 x=x(i) = 2x|x=x(i) = 2x(i)
dx

1
x(i + 1) = x(i) +
9 x 2 (i)
2x(i)
J(i) =
Starting with x(0) = 1, successive calculations of the NR equations gives:

i
x(i)
0
1
1
5.00000
2
3.40000
3
3.02353
Power flows
4
3.00009
5
3.00000
April 15th, 2015
27 / 52
Newton-Raphson
Exercise: Newton-Raphson method: solution to NLAE

Solve:
x1 + x2
x1 x2

=
15
50

x0 =
4
9
Defining f1 = (x1 + x2 ) and f2 = x1 x2 , we have:

"
1
J(i)
x1 (i + 1)
x2 (i + 1)
f1
x1
f2
x1
f1
x2
f2
x2

=
i
x1 (i)
x2 (i)

=
x=x(i)
x1 (i)
x2 (i)
0
4
9
1
1
x2 (i) x1 (i)
1
+
x1 (i) x2 (i)
1
5.20000
9.80000
2
4.99130
10.00870
Power flows
1
1
=
x1 (i) x2 (i)
x1 (i) 1
x2 (i)
1
3
4.99998
10.00002

x1 (i) 1
x2 (i)
1
15 x1 (i) x2 (i)
50 x1 (i)x2 (i)
4
5.00000
10.00000
April 15th, 2015
28 / 52
Newton-Raphson
Exercise: Newton-Raphson method: solution to NLAE

Solve:
x1 + x2
x1 x2

=
15
50

x0 =
4
9
Defining f1 = (x1 + x2 ) and f2 = x1 x2 , we have:

"
1
J(i)
x1 (i + 1)
x2 (i + 1)
f1
x1
f2
x1
f1
x2
f2
x2

=
i
x1 (i)
x2 (i)

=
x=x(i)
x1 (i)
x2 (i)
0
4
9
1
1
x2 (i) x1 (i)
1
+
x1 (i) x2 (i)
1
5.20000
9.80000
2
4.99130
10.00870
Power flows
1
1
=
x1 (i) x2 (i)
x1 (i) 1
x2 (i)
1
3
4.99998
10.00002

x1 (i) 1
x2 (i)
1
15 x1 (i) x2 (i)
50 x1 (i)x2 (i)
4
5.00000
10.00000
April 15th, 2015
28 / 52
Newton-Raphson
Newton-Raphson method
Equation (14) can be rewritten as follows:
(16)
J(i)x(i) = y(i)
x(i) = x(i + 1) x(i)
(17)
y(i) = y f[x(i)]
(18)
The following 4 steps complete the NR algorithm:

1
Compute y (i) from (18)
Compute J(i) from (15)
Using Gauss elimination and back substitution, solve (16)
Compute x(i + 1) from (17)
Power flows
April 15th, 2015
29 / 52
Newton-Raphson
Newton-Raphson method
Equation (14) can be rewritten as follows:
(16)
J(i)x(i) = y(i)
x(i) = x(i + 1) x(i)
(17)
y(i) = y f[x(i)]
(18)
The following 4 steps complete the NR algorithm:

1
Compute y (i) from (18)
Compute J(i) from (15)
Using Gauss elimination and back substitution, solve (16)
Compute x(i + 1) from (17)
Power flows
April 15th, 2015
29 / 52
Newton-Raphson
Exercise: Newton-Raphson in four steps
Complete the aforementioned four steps for solving the previos exercise.

x1 + x2
15
4
=
x0 =
x1 x2
50
9
Power flows
April 15th, 2015
30 / 52
The power flow problem

The computation of voltage magnitude and phase angle at each bus in
a power system under balanced three-phase steady-state conditions.
The starting point for a power-flow problem is a single-line diagram of
the power system, from which the input data for computer solutions
can be obtained.
The following variables are associated with each bus k:
Voltage magnitude Vk ;
Phase angle k ;
3 Net real power Pk ; and
4 Reactive power Qk supplied to the bus.
1
2
At each bus, two of these variables are specified as input data, and the
other two are unknowns to be computed by the power-flow program
Power flows
April 15th, 2015
31 / 52
Power flows
April 15th, 2015
32 / 52

The power delivered to bus k is separated into generator and load terms:
Pk
= PGk PLk
(19)
Qk
= QGk QLk
(20)
Each bus k is categorized into one of the following three bus types:
1
Swing bus (or slack bus). The swing bus is a reference bus for which
V1 , tipically 1.00o
Load (PQ) bus. Pk and Qk are input data. The power-flow program
computes Vk and k .
Voltage controlled (PV) bus. Pk and Vk are input data. The

power-flow program computes Qk and k . Maximum and mininum var
limits of the equipment in these kind of nodes are also input data.
Power flows
April 15th, 2015
33 / 52

The power delivered to bus k is separated into generator and load terms:
Pk
= PGk PLk
(19)
Qk
= QGk QLk
(20)
Each bus k is categorized into one of the following three bus types:
1
Swing bus (or slack bus). The swing bus is a reference bus for which
V1 , tipically 1.00o
Load (PQ) bus. Pk and Qk are input data. The power-flow program
computes Vk and k .
Voltage controlled (PV) bus. Pk and Vk are input data. The

power-flow program computes Qk and k . Maximum and mininum var
limits of the equipment in these kind of nodes are also input data.
Power flows
April 15th, 2015
33 / 52
Node equations
The node equations can be summarized into three steps:
1
Consider a circuit with N + 1 nodes, called also buses. Select one

node as the reference bus and define all the remaining node voltages
with respect to this node.
Transform every voltage source and its respective series impedance
into an equivalent current source in parallel with the corresponding
admittance.
Write node equations as follows:
Y11 Y12 Y1N

V10
I10
Y21 Y22 Y2N V20 I20
(21)
..
..
.. .. = ..
.
.
.
.
.
. . .
YN1 YN2 . . .
YNN
VN0
IN0
where YNN is the bus admittance matrix, and VN1 and IN1 are
the voltage and current vectors.
Power flows
April 15th, 2015
34 / 52
Node equations
The elements Yij of the admittance matrix are formed as follows:
Ykk
N
X
Admittances connected to bus k
(22)
k=1
Ykn =
N
X
Admittances connected between buses k and n (23)
k=1
k6=n
The off-diagonal elements Ykn of Y are called mutual admittances and the
diagonal elements Ykk are called self-admitances. The node equations are
actually current equations written for each node in compliance with
Kirchhoffs current law.
Power flows
April 15th, 2015
35 / 52
Example: Power-flow input data and Ybus
Bus
1
2
3
4
5
Type
Swing
Load
Const. voltage
Load
Load
V
1.0
1.05
-
(deg)
0
-
PG
0.0
5.2
0.0
0.0
QG
0.0
0.0
0.0
PL
0.0
8.0
0.8
0.0
0.0
QL
0.0
2.8
0.4
0.0
0.0
QGmax
4.0
-
QGmin
-2.8
-
Sbase = 100 MVA, Vbase = 15 kV at buses 1, 3, and 345 kV at buses, 2, 4, 5

Power flows
April 15th, 2015
36 / 52

Table : Line input data
Bus-to-bus
2-4
2-5
4-5
R0
0.0090
0.0045
0.00225
X0
0.100
0.050
0.025
G0
0.0
0.0
0.0
B0
1.72
0.88
0.44
max MVA
12.0
12.0
12.0
Table : Transformer input data

Bus-to-bus
1-5
3-4
R
0.00150
0.00075
X
0.02
0.01
Gc
0.0
0.0
Bm
0.0
0.0
max MVA
6.0
10.0
max TAP sett

-
Table : Input data and unknows

Bus
1
2
3
4
5
Input data
V1 = 1.0, 1 = 0.0
P2 = PG 2 PL2 = 8
Q2 = QG 2 QL2 = 2.8
V3 = 1.05
P3 = PG 3 PL3 = 4.4
P4 = 0, Q4 = 0
P5 = 0, Q5 = 0
Power flows
Unknows
P1 , Q1
V2 , 2
Q3 , 3
V4 , 4
V5 , 5
April 15th, 2015
37 / 52

The elements of Ybus are computed as follows:
Y21 = Y23 = 0
1
1
Y24 =
=
= 0.89276 + j9.91964
0
0
R24 + jX24
0.009 + j0.1
1
1
Y25 =
0 + jX 0 = 0.0045 + j0.05 = 1.78552 + j19.8393
R25
25
0
0
1
1
B24
B25
Y22 =
+
+
j
+
j
0 + jX 0
0 + jX 0
R24
R25
2
2
24
25
1.72
0.88
= (0.892 j9.91964) + (1.78552 j19.83932) + j
+j
2
2
= 2.67828 j28.4590
Power flows
April 15th, 2015
38 / 52
Power-flow equations
For power system and load flow analysis, a set of power balance equations
is used:
Pk
Qk
= Vk
= Vk
N
X
n=1
N
X
Ykn Vn cos (k n kn )
(24)
Ykn Vn sin (k n kn )
(25)
n=1
where Vk and k are the magnitude and angle of node k voltage; Ykn and
kn are the magnitude and angle of the element of the k-th row and n-th
column of the admittance matrix Y; and Pk and Qk are the active and
reactive power at node k.
Power flows
April 15th, 2015
39 / 52
Power-flow solution by Newton-Raphson
2
..

.
;
x =
=
V
V2
..
.
VN
P2
..

.
PN
P
y=
=
Q
Q2
..
.
QN
P2 (x)
..

P(x)
P
(x)
N
f(x) =
=
Q(x)
Q2 (x)
..
.
QN (x)
where all V, P and Q terms are in per-unit and terms are in radians.
Power flows
April 15th, 2015
40 / 52
yk
yk+N
= Pk = Pk (x) = Vk
= Qk = Qk (x) = Vk
N
X
n=1
N
X
(26)
(27)
n=1
k = 2, 3, . . . , N
P2
...
2
..
..
.
.
PN . . .
2
J =
Q2

...
2
..
..
.
.
QN
2
...
P2
N
..
.
P2
V2
..
.
PN
N
PN
V2
Q2
N
Q2
V2
QN
N
QN
V2
..
.
..
.
Power flows
...
..
.
...
P2
VN
...
..
.
...
Q2
VN
..
.
PN
VN
..
.
QN
VN
April 15th, 2015
(28)
41 / 52

n 6= k
J1kn
J2kn
J3kn
J4kn
n=k
J1kk
Pk
n
Pk
n
Qk
n
Qk
n
Pk
= Vk
k
= Vk Ykn Vn sin (k n kn )
= Vk Ykn Vn cos (k n kn )
= Vk Ykn Vn cos (k n kn )
= Vk Ykn Vn sin (k n kn )
N
X
n=1;n6=k
N
J2kk
X
Pk
= Vk Ykk cos kk +
k
n=1
J3kk
Qk
= Vk
k
N
X
n=1;n6=k
N
J4kk
X
Qk
= Vk Ykk sin kk +
k
n=1
Power flows
April 15th, 2015
42 / 52
Power-flow solution by Newton-Raphson (algorithm)

1
2
3
Use (13) and (16) to compute:

P(i)
P P[x(i)]
y(i) =
=
Q(i)
Q Q[x(i)]
(29)
Calculate the Jacobian

Use Gauss elimination and back substitution to solve

J1(i) J2(i)
(i)
P(i)
=
V(i)
Q(i)
J3(i) J4(i)
(30)
Compute

x(i + 1) =
(i + 1)
V(i + 1)

=
(i)
V(i)

+
(i)
V(i)

(31)
Starting with initial value x(0), the procedure continues until convergence
is obtained or until the number of iterations exceeds a specified maximum.
Power flows
April 15th, 2015
43 / 52
Power-flow solution by Newton-Raphson (algorithm)
For each voltage-controlled bus, the magnitude Vk is already known,

and the function Qk (x) is not needed.
We could omit Vk from the x vector and Qk from the y vector. We
could also omit from the Jacobian matrix the column corresponding to
partial derivatives with respect to Vk and the row corresponding to
partial derivatives of Qk (x).
Rows and corresponding columns for voltage-controlled buses can be
retained in the Jacobian matrix. Then during each iteration, the
voltage magnitude Vk (i + 1) of each voltage-controlled bus is reset to
Vk , which is input data for that bus.
Power flows
April 15th, 2015
44 / 52
Control of power flow
The following means are used to control system power flows:

Prime mover and excitation control of generators;
Switching of shunt capacitor banks, shunt reactors, and static var
systems;
Control of tap-changing and regulating transformers.
Power flows
April 15th, 2015
45 / 52
Control of power flow (generator control)
Vt is the generator terminal voltage, Eg is the excitation voltage, is the

power angle, and Xg is the positive-sequence synchronous reactance.
I
Eg e j
Vt
P + jQ = Vt I = Vt
Re S =
Eg e j Vt
jXg
Vt Eg
sin
Xg
Vt
Im S =
(Eg cos Vt )
Xg
Power flows
(32)
(33)
April 15th, 2015
46 / 52

Eq. (32) shows that the real power P increases when the power angle
increases.
When the prime mover increases the power input to the generator
while the excitation voltage is held constant, the rotor speed increases.
As the rotor speed increases, the power angle also increases, causing
an increase in generator real power output P. There is also a decrease
in reactive power output Q, given by (33).
From the power-flow standpoint, an increase in prime-move power
corresponds to an increase in P at the constant-voltage bus to which
the generator is connected. The power-flow program computes the
increase in along with the small change in Q.
Power flows
April 15th, 2015
47 / 52

Equation (33) shows that Q increases when the excitation voltage Eg
increases. From the operational standpoint, when the generator
exciter output increases while holding the prime-mover power
constant, the rotor current increases.
As the rotor current increases, the excitation voltage Eg also increases,
causing an increase in generator reactive power output Q. There is
also a small decrease in d required to hold P constant in (32).
From the power-flow standpoint, an increase in generator excitation
corresponds to an increase in voltage magnitude at the
constant-voltage bus to which the generator is connected. The
power-flow program computes the increase in reactive power Q
supplied by the generator along with the small change in .
Power flows
April 15th, 2015
48 / 52
Control of power flow (shunt capacitor)
Before the capacitor bank is connected, the switch SW is open and the bus
voltage equals ETh .
After the bank is connected, SW is closed, and the capacitor current IC
leads the bus voltage Vt by 90o . The phasor diagram shows that Vt is larger
than ETh when SW is closed.
From the power-flow standpoint, the addition of a shunt capacitor bank to a
load bus corresponds to the addition of a negative reactive load, since a
capacitor absorbs negative reactive power.
The power-flow program computes the increase in bus voltage magnitude
along with the small change in .
Power flows
April 15th, 2015
49 / 52
Power-flow solution in MATLAB
Power flows
April 15th, 2015
50 / 52
Summary and questions
Summary
In this session we have studied:

Different wind turbines configurations;
Numerical methods for solving linear an nonlinear algebraic equations;
The power-flow problem;
The Newton-Raphson algorithm for solving the power-flow problem.
Power flows
April 15th, 2015
51 / 52
Appendix
Questions
Preguntas
Power flows
April 15th, 2015
52 / 52

Electrical Microgrids Design Session 3 Power Flows: Luis Ismael Minchala Avila

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Electrical Microgrids Design Session 3 Power Flows: Luis Ismael Minchala Avila

Uploaded by

Copyright:

Available Formats

Electrical microgrids design

Ismael Minchala A. (UCuenca)

April 15th, 2015

Jacobi and Gauss-Seidel

The power-flow problem

Control of power-flow problem

Summary and questions

Ismael Minchala A. (UCuenca)

April 15th, 2015

Successful power system operation under normal balanced three-phase

Ismael Minchala A. (UCuenca)

April 15th, 2015

Successful power system operation under normal balanced three-phase

Ismael Minchala A. (UCuenca)

April 15th, 2015

The PF program computes the voltage magnitude and angle at each

Ismael Minchala A. (UCuenca)

April 15th, 2015

Characteristics of WTG for WPP

Wind turbine generators (WTG) have developed from small machines

Ismael Minchala A. (UCuenca)

April 15th, 2015

Characteristics of WTG for WPP

April 15th, 2015

Type 1 WTG: Limited Variable Speed

Squirrel-cage Induction Generator (SCIG) connected directly to the

Ismael Minchala A. (UCuenca)

April 15th, 2015

Type 1 WTG: Limited Variable Speed

Ismael Minchala A. (UCuenca)

April 15th, 2015

Type 2 WTG: Limited Variable Speed

Wound rotor induction generators are connected directly to the WTG

Ismael Minchala A. (UCuenca)

April 15th, 2015

Type 2 WTG: Limited Variable Speed

Ismael Minchala A. (UCuenca)

April 15th, 2015

Type 3: Variable speed partial power electronics conversion

Known commonly as the doubly fed induction generator (DFIG) or

Ismael Minchala A. (UCuenca)

April 15th, 2015

Type 4: Variable speed with full power electronics conversion

Ismael Minchala A. (UCuenca)

April 15th, 2015

Ismael Minchala A. (UCuenca)

April 15th, 2015

Voltage control capabilities

The voltage control capabilities of a WTG depend on the wind turbine

Ismael Minchala A. (UCuenca)

April 15th, 2015

Solutions to LAE: Gauss elimination

If A is an upper triangular matrix with nonzero diagonal elements, we have:

Ismael Minchala A. (UCuenca)

Solutions to LAE: Gauss elimination

If A is an upper triangular matrix with nonzero diagonal elements, we have:

Ismael Minchala A. (UCuenca)

Ismael Minchala A. (UCuenca)

April 15th, 2015

Ismael Minchala A. (UCuenca)

April 15th, 2015

Example: Gauss elimination and back substitution

Ismael Minchala A. (UCuenca)