optimal power flow daniel kirschen © 2011 d. kirschen and the university of washington 1

50
Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

Upload: brittany-tobin

Post on 29-Mar-2015

217 views

Category:

Documents


2 download

TRANSCRIPT

Page 1: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

1

Optimal Power Flow

Daniel Kirschen

© 2011 D. Kirschen and the University of Washington

Page 2: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

2

Economic dispatch

• Objective: minimize the cost of generation• Constraints

– Equality constraint: load generation balance– Inequality constraints: upper and lower limits on

generating units output

© 2011 D. Kirschen and the University of Washington

A B C L

Page 3: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

3

Limitations of economic dispatch

• Generating units and loads are not all connected to the same bus

• The economic dispatch may result in unacceptable flows or voltages in the network

© 2011 D. Kirschen and the University of Washington

Network

A

B C

D

Page 4: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

4

Example of network limitation

© 2011 D. Kirschen and the University of Washington

AB

100$/MWh50 $/MWh

Maximum flow on each line: 100MW

PA PB

PAMAX PB

MAX

LBLA

Page 5: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

5

Acceptable ED solution

© 2011 D. Kirschen and the University of Washington

AB

LB = 200MWLA = 100 MW 100 MW

100 MW

The flows on the lines are below the limitThe economic dispatch solution is acceptable

The solution of this (trivial) economic dispatch is:

0 MW300 MW

Page 6: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

6

Unacceptable ED solution

© 2011 D. Kirschen and the University of Washington

AB

The solution of the economic dispatch is:

500 MW0 MW

200 MW

200 MW

The resulting flows exceed their limitThe economic dispatch solution is not acceptable

LB = 400MWLA = 100 MW

Page 7: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

7

Modified ED solution

© 2011 D. Kirschen and the University of Washington

In this simple case, the solution of the economic dispatch can be modified easily to produce acceptable flows.

AB

300 MW200 MW

100 MW

100 MW

LB = 400MWLA = 100 MW

This could be done mathematically by adding the followinginequality constraint:

However, adding inequality constraints for each problem is not practical in more complex situationsWe need a more general approach

Page 8: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

8

Optimal Power Flow (OPF) - Overview

• Optimization problem• Classical objective function

– Minimize the cost of generation• Equality constraints

– Power balance at each node - power flow equations

• Inequality constraints– Network operating limits (line flows, voltages)– Limits on control variables

© 2011 D. Kirschen and the University of Washington

Page 9: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

9

Mathematical formulation of the OPF (1)

• Decision variables (control variables)– Active power output of the generating units– Voltage at the generating units– Position of the transformer taps– Position of the phase shifter (quad booster) taps– Status of the switched capacitors and reactors– Control of power electronics (HVDC, FACTS)– Amount of load disconnected

• Vector of control variables:

© 2011 D. Kirschen and the University of Washington

Page 10: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

10

Mathematical formulation of the OPF (2)

• State variables– Describe the response of the system to changes in

the control variables– Magnitude of voltage at each bus

• Except generator busses, which are control variables– Angle of voltage at each bus

• Except slack bus

• Vector of state variables:

© 2011 D. Kirschen and the University of Washington

Page 11: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

11

Mathematical formulation of the OPF (3)

• Parameters– Known characteristics of the system– Assumed constant

• Network topology• Network parameters (R, X, B, flow and voltage limits)• Generator cost functions• Generator limits• …

• Vector of parameters:

© 2011 D. Kirschen and the University of Washington

Page 12: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

12

Mathematical formulation of the OPF (4)

• Classical objective function:– Minimize total generating cost:

• Many other objective functions are possible:

– Minimize changes in controls:

– Minimize system losses– …

© 2011 D. Kirschen and the University of Washington

Page 13: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

13

Mathematical formulation of the OPF (5)

• Equality constraints:– Power balance at each node - power flow

equations

• Compact expression:

© 2011 D. Kirschen and the University of Washington

Page 14: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

14

Mathematical formulation of the OPF (6)

• Inequality constraints:– Limits on the control variables:

– Operating limits on flows:

– Operating limits on voltages

• Compact expression:

© 2011 D. Kirschen and the University of Washington

Page 15: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

15

Compact form of the OPF problem

© 2011 D. Kirschen and the University of Washington

Subject to:

Page 16: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

16

OPF Challenges

• Size of the problem– 1000’s of lines, hundreds of controls– Which inequality constraints are binding?

• Problem is non-linear• Problem is non-convex• Some of the variables are discrete

– Position of transformer and phase shifter taps– Status of switched capacitors or reactors

© 2011 D. Kirschen and the University of Washington

Page 17: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

17

Solving the OPF using gradient methods

• Build the Lagrangian function

• The gradient of the Lagrangian indicates the direction of steepest ascent:

• Move in the opposite direction to the point with the largest gradient

• Repeat until

© 2011 D. Kirschen and the University of Washington

Page 18: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

18

Problems with gradient methods

• Slow convergence• Objective function and constraints must be

differentiable• Difficulties in handling inequality constraints

– Binding inequality constraints change as the solution progresses

– Difficult to enforce the complementary slackness conditions

© 2011 D. Kirschen and the University of Washington

Page 19: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

19

Solving the OPF using interior point method

• Best technique when a full AC solution is needed

• Handle inequality constraints using barrier functions

• Start from a point in the “interior” of the solution space

• Efficient solution engines are available

© 2011 D. Kirschen and the University of Washington

Page 20: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

20

Linearizing the OPF problem

• Use the power of linear programming• Objective function

– Use linear or piecewise linear cost functions• Equality constraints

– Use dc power flow instead of ac power flow• Inequality constraints

– dc power flow provides linear relations between injections (control variables) and MW line flows

© 2011 D. Kirschen and the University of Washington

Page 21: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

21

Sequential LP OPF

• Consequence of linear approximation– The solution may be somewhat sub-optimal– The constraints may not be respected exactly

• Need to iterate the solution of the linearized problem• Algorithm:

1. Linearize the problem around an operating point2. Find the solution to this linearized optimization3. Perform a full ac power flow at that solution to

find the new operating point4. Repeat

© 2011 D. Kirschen and the University of Washington

Page 22: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

22

Advantages and disadvantages

• Advantages of LPOPF method– Convergence of linear optimization is guaranteed– Fast– Reliable optimization engines are available– Used to calculate nodal prices in electricity

markets• Disadvantages

– Need to iterate the linearization– “Reactive power” aspects (VAr flows, voltages) are

much harder to linearize than the “active power aspects” (MW flows)

© 2011 D. Kirschen and the University of Washington

Page 23: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

DC Power Flow Approximation

Page 24: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

Power Flow Equations

• Set of non-linear simultaneous equations• Need a simple linear relation for fast and

intuitive analysis• dc power flow provides such a relation but

requires a number of approximations

Page 25: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

Neglect Reactive Power

Page 26: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

Neglect Resistance of the Branches

Page 27: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

Assume All Voltage Magnitudes = 1.0 p.u.

Page 28: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

Assume all angles are small

Page 29: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

Interpretation

Page 30: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

Why is it called dc power flow?

• Reactance plays the role of resistance in dc circuit

• Voltage angle plays the role of dc voltage• Power plays the role of dc current

Page 31: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

31

Example of LPOPF

• Solving the full non-linear OPF problem by hand is too difficult, even for small systems

• We will solve linearized 3-bus examples by hand

© 2011 D. Kirschen and the University of Washington

Page 32: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

32

Example

© 2011 D. Kirschen and the University of Washington

1 2

3

BA

450 MW

10 $/MWhPA

PAMAX=390MW

20$/MWhPB

PBMAX= 150 MW

Economic dispatch:

Page 33: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

33

Flows resulting from the economic dispatch

© 2011 D. Kirschen and the University of Washington

1 2

3

BA

450 MW

390MW 60MW

Assume that all the lines have the same reactance

Fmax = 200MW

Fmax = 200MWFmax = 260MW

Do these injection result in acceptable flows?

Page 34: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

34

Calculating the flows using superposition

© 2011 D. Kirschen and the University of Washington

Because we assume a linear model, superposition is applicable

1

60 MW

2

3

450 MW

390 MW

1 2

3390 MW

390 MW 60 MW

1 2

3

60 MW

Page 35: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

35

Calculating the flows using superposition (1)

© 2011 D. Kirschen and the University of Washington

1 2

3390 MW

390 MW

FAFB

FA = 2 x FB because the path 1-2-3 has twice the reactanceof the path 1-3

FA + FB = 390 MW

FA = 260 MWFB = 130 MW

Page 36: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

36

Calculating the flows using superposition (2)

© 2011 D. Kirschen and the University of Washington

1 2

360 MW

60 MW

FDFC

FC = 2 x FD because the path 2-1-3 has twice the reactanceof the path 2-3

FC + FD = 60 MW

FC = 40 MWFD = 20 MW

Page 37: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

37

Calculating the flows using superposition (3)

© 2011 D. Kirschen and the University of Washington

1 2

3390 MW

390 MW 60 MW

1 2

3

60 MW

260 MW130 MW 20 MW

40 MW

280 MW1

60 MW

2

3

450 MW

390 MW110 MW

170 MW

Fmax = 260 MW

Page 38: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

38

Correcting unacceptable flows

• Must use a combination of reducing the injection at bus 1 and increasing the injection at bus 2 to keep the load/generation balance

• Decreasing the injection at 1 by 3 MW reduces F1-3 by 2 MW• Increasing the injection at 2 by 3 MW increases F1-3 by 1 MW• A combination of a 3 MW decrease at 1 and 3 MW increase at 2

decreases F1-3 by 1 MW• To achieve a 20 MW reduction in F1-3 we need to shift 60 MW of

injection from bus 1 to bus 2© 2011 D. Kirschen and the University of Washington

280 MW1

60 MW

2

3450 MW

390 MW

Must reduce flow F1-3 by 20 MW

Page 39: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

39

Check the solution using superposition

© 2011 D. Kirschen and the University of Washington

1 2

3330 MW

330 MW 120 MW

1 2

3

120 MW

220 MW110 MW 40 MW

80 MW

1

120 MW

2

3

450 MW

330 MW

260 MW

70 MW

190 MW

Fmax = 260 MW

Page 40: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

40

Comments (1)

• The OPF solution is more expensive than the ED solution– CED = 10 x 390 + 20 x 60 = $5,100

– COPF = 10 x 330 + 20 x 120 = $5,700

• The difference is the cost of security– Csecurity = COPF - CED = $600

• The constraint on the line flow is satisfied exactly– Reducing the flow below the limit would cost

more© 2011 D. Kirschen and the University of Washington

Page 41: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

41

Comments (2)

• We have used an “ad hoc” method to solve this problem

• In practice, there are systematic techniques for calculating the sensitivities of line flows to injections

• These techniques are used to generate constraint equations that are added to the optimization problem

© 2011 D. Kirschen and the University of Washington

Page 42: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

42

Security Constrained OPF (SCOPF)

• Conventional OPF only guarantees that the operating constraints are satisfied under normal operating conditions – All lines in service

• This does not guarantee security– Must consider N-1 contingencies

© 2011 D. Kirschen and the University of Washington

Page 43: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

43

Example: base case solution of OPF

© 2011 D. Kirschen and the University of Washington

1 2

3

BA

450 MW

330MW 120MW

260 MW

70 MW

190 MW

Page 44: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

44

Example: contingency case

© 2011 D. Kirschen and the University of Washington

1 2

3

BA

450 MW

330MW 120MW

330 MW

0 MW

120 MW

Unacceptable because overload of line 1-3 could lead toa cascade trip and a system collapse

Page 45: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

45

Formulation of the Security Constrained OPF

© 2011 D. Kirschen and the University of Washington

Subject to: Power flow equations for the base case

Operating limits for the base case

Power flow equations for contingency k

Operating limits for contingency k

Subscript 0 indicates value of variables in the base caseSubscript k indicates value of variables for contingency k

Page 46: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

46

Preventive security formulation

© 2011 D. Kirschen and the University of Washington

subject to:

This formulation implements preventive security becausethe control variables are not allowed to change after thecontingency has occurred:

Page 47: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

47

Corrective security formulation

• This formulation implements corrective security because the control variables are allowed to change after the contingency has occurred

• The last equation limits the changes that can take place to what can be achieved in a reasonable amount of time

• The objective function considers only the value of the controlvariables in the base case

© 2011 D. Kirschen and the University of Washington

subject to:

Page 48: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

48

Size of the SCOPF problem

• Example - European transmission network:– 13,000 busses 13,000 voltage constraints– 20,000 branches 20,000 flow constraints– N-1 security 20,000 contingencies– In theory, we must consider

20,000 x (13,000 + 20,000) = 660 million inequality constraints…

• However:– Not all contingencies create limit violations– Some contingencies have only a local effect

© 2011 D. Kirschen and the University of Washington

Page 49: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

49

Limitations of N-1 criterion

• Not all contingencies have the same probability– Long lines vs. short lines– Good weather vs. bad weather

• Not all contingencies have the same consequences– Local undervoltage vs. edge of stability limit

• N-2 conditions are not always “not credible”– Non-independent events

• Does not ensure a consistent level of risk– Risk = probability x consequences

© 2011 D. Kirschen and the University of Washington

Page 50: Optimal Power Flow Daniel Kirschen © 2011 D. Kirschen and the University of Washington 1

50

Probabilistic security analysis

• Goal: operate the system at a given risk level• Challenges

– Probabilities of non-independent events• “Electrical” failures compounded by IT failures

– Estimating the consequences• What portion of the system would be blacked out?

– What preventive measures should be taken?• Vast number of possibilities

© 2011 D. Kirschen and the University of Washington