Académique Documents
Professionnel Documents
Culture Documents
Flow Problem
Prof. Daniel Kirschen
The University of Manchester
Outline
A bit of background
Power
Transmission Network
Loads
Greed
Minimum cost
Maximum profit
2010 D. Kirschen and The University of Manchester
Fear
Avoid outages and blackouts
2010 D. Kirschen and The University of Manchester
Green
Accommodate renewables
Cost
2010 D. Kirschen and The University of Manchester
Reliability
8
State variables
Voltage at every node (a.k.a. bus) of the
network
Because we are dealing with ac, voltages are
represented by phasors, i.e. complex numbers
in polar representation:
Voltage magnitude at each bus: Vk
Voltage angle at each bus: k
10
Other variables
Active and reactive power consumed at each
bus: PkL ,QkL
a.k.a. the load at each bus
11
Active power
12
Injections
Bus k
Pk ,Qk
PkG ,Q kG
PkL ,Q kL
PkW ,QkW
13
Injections
Vk k
Bus k
Pk ,Qk
14
Line flows
To bus i
Pkj ,Q kj
Pki ,Q ki
Vk k
To bus j
Bus k
Pk ,Qk
15
Pkj ,Q kj
Pki ,Q ki
Vk k
To bus j
Bus k
Pk ,Qk
k 1,L N
i1
16
k 1,L N
i1
Typical values of N:
GB transmission network: N~1,500
Continental European network (UCTE): N~13,000
However, the equations are highly sparse!
2010 D. Kirschen and The University of Manchester
17
18
Linear approximation
N
Pk Bki ki
i1
i1
19
20
Control variables
Control variables which have a cost:
Active power production of thermal generating units:Pi G
21
min Ci (Pi G )
i1
min ci Pi G ci Pi G
i1
22
Equality constraints
Power balance at each node bus, i.e. power flow
equations
N
k 1,L N
i1
23
Inequality constraints
Upper limit on the power flowing though every
branch of the network
Upper and lower limit on the voltage at every
node of the network
24
min f0 x 0 ,u0
u0
h x ,u 0
g x 0 ,u0 0
0
25
26
27
A transformer blows up
The system must keep going despite such events
N-1 security criterion
28
Security-constrained OPF
How should the control variables be set to
minimise the cost of running the system while
ensuring that the operating constraints are
satisfied in both the normal and all the
contingency states?
29
f0 x 0 ,u0
s.t.
g k (x k ,u k ) 0
k 0,..., N c
h k (x k ,u k ) 0
k 0,..., N c
u k u0 u max
k
k 1,..., N c
uk
k 0:
normal conditions
30
f0 x 0 ,u0
s.t.
g k (x k ,u k ) 0
k 0,..., N c
h k (x k ,u k ) 0
k 0,..., N c
u k u0 u max
k
k 1,..., N c
uk
31
32
33
34
35
36
min
s.t.
6 4 7 4 8
6 additional
4 4 7generation
4 48
nd T
c T p0 p0M b*T
c
p
c
0
0
0
p0 p0M p0max
nd
nd
p min
b0T p0nd b0T p max
b0T
b0 0,1
s min s s max
Vector of uncertainties
37
nd T
max c T p0 p0M bT
c
p
c
0
0
0
s
s.t.
s min s s max
p ,u ,b ,p
nd
0
arg
b0 0,1
38
nd T
max c T p0 p0M bT
c
p
c
0
0
0
s
s.t.
s min s s max
b0 0,1
2010 D. Kirschen and The University of Manchester
39