Economic Dispatch

ECE 476
POWER SYSTEM ANALYSIS
Lecture 16
Economic Dispatch
Professor Tom Overbye
Department of Electrical and
Computer Engineering
Announcements




Homework 7 is 6.46, 6.49, 6.52, 11.19, 11.21,
11.27; due date is Thursday October 30
Potential spring courses: ECE 431 and ECE
398RES (Renewable Electric Energy Systems)
Be reading Chapter 11, concentrating on sections
11.4 and 11.5
Design Project is assigned today (see website for
details). Due date is Nov 20.
1
In the News: Wind Blade Failure
Photo source: Peoria Journal Star
Last Wednesday a 140 foot,
6.5 ton blade fell off from a
Suzlon Energy wind turbine.
The wind turbine is located
in a small wind farm near
Peoria. Suzlon Energy is one
of the world’s largest wind
turbine manufacturers; its
shares fell 39% following the
accident. No one was hurt
and wind turbines failures
are extremely rare events.
2
Thermal Plants Can Fail As Well:
CWLP Dallman Explosion, Fall 2007
3
CWLP Dallman Explosion, Fall 2007
4
Economic Dispatch: Formulation

The goal of economic dispatch is to determine the
generation dispatch that minimizes the
instantaneous operating cost, subject to the
constraint that total generation = total load + losses
m
Minimize
CT
 Ci ( PGi )
i 1
Such that
m
 PGi  PD  PLosses
i=1
Initially we'll
ignore generator
limits and the
losses
5
Unconstrained Minimization



This is a minimization problem with a single
inequality constraint
For an unconstrained minimization a necessary (but
not sufficient) condition for a minimum is the
gradient of the function must be zero, f (x)  0
The gradient generalizes the first derivative for
multi-variable problems:
f (x)
 f (x) f (x)
 x , x ,
 1
2
f (x) 
,
xn 
6
Minimization with Equality Constraint


When the minimization is constrained with an
equality constraint we can solve the problem using
the method of Lagrange Multipliers
Key idea is to modify a constrained minimization
problem to be an unconstrained problem
That is, for the general problem
minimize f (x) s.t. g(x)  0
We define the Lagrangian
L(x,λ )  f (x)  λ T g(x)
Then a necessary condition for a minimum is the
L x (x,λ )  0
and
L λ (x,λ )  0
7
Economic Dispatch Lagrangian
For the economic dispatch we have a minimization
constrained with a single equality constraint
L(PG ,  ) 
m
m
 Ci ( PGi )   ( PD   PGi )
i 1
(no losses)
i 1
The necessary conditions for a minimum are
L(PG ,  )
PGi
dCi ( PGi )

  0
dPGi
(for i  1 to m)
m
PD   PGi  0
i 1
8
Minimization with Equality Constraint


When the minimization is constrained with an
equality constraint we can solve the problem using
the method of Lagrange Multipliers
Key idea is to modify a constrained minimization
problem to be an unconstrained problem
That is, for the general problem
minimize f (x) s.t. g(x)  0
We define the Lagrangian
L(x,λ )  f (x)  λ T g(x)
Then a necessary condition for a minimum is the
L x (x,λ )  0
and
L λ (x,λ )  0
9
Economic Dispatch Lagrangian
For the economic dispatch we have a minimization
constrained with a single equality constraint
L(PG ,  ) 
m
m
 Ci ( PGi )   ( PD   PGi )
i 1
(no losses)
i 1
The necessary conditions for a minimum are
L(PG ,  )
PGi
dCi ( PGi )

  0
dPGi
(for i  1 to m)
m
PD   PGi  0
i 1
10
Economic Dispatch Example
What is economic dispatch for a two generator
system PD  PG1  PG 2  500 MW and
C1 ( PG1 )  1000 20 PG1  0.01PG21
$ / hr
C2 ( PG 2 )  400 15 PG 2  0.03PG22
$ / hr
Using the Largrange multiplier method we know
dC1 ( PG1 )

dPG1
 20  0.02 PG1  
0
dC2 ( PG 2 )

dPG 2
 15  0.06 PG 2  
0
500  PG1  PG 2  0
11
Economic Dispatch Example, cont’d
We therefore need to solve three linear equations
20  0.02 PG1  
0
15  0.06 PG 2  
0
500  PG1  PG 2  0
0
1  PG1   20 
0.02
 0
0.06 1  PG 2    15 


 

1 0      500 
 1
 PG1 
 312.5 MW 
 P    187.5 MW 
 G2 


  
 26.2 $/MWh 
12
Lambda-Iteration Solution Method


The direct solution only works well if the
incremental cost curves are linear and no generators
are at their limits
A more general method is known as the lambdaiteration
–
–
the method requires that there be a unique mapping
between a value of lambda and each generator’s MW
output
the method then starts with values of lambda below and
above the optimal value, and then iteratively brackets the
optimal value
13
Lambda-Iteration Algorithm
Pick  L and  H such that
m
L
P
(

 Gi )  PD  0
H
P
(

 Gi )  PD  0
i=1
i=1
While
m
 H   L   Do
 M  ( H   L ) / 2
m
If
M
H
M
P
(

)

P

0
Then



 Gi
D
i=1
Else  L   M
End While
14
Lambda-Iteration: Graphical View
In the graph shown below for each value of lambda
there is a unique PGi for each generator. This
relationship is the PGi() function.
15
Lambda-Iteration Example
Consider a three generator system with
IC1 ( PG1 )  15  0.02 PG1

$/MWh
IC2 ( PG 2 )  20  0.01PG 2

$/MWh
IC3 ( PG 3 )  18  0.025 PG 3

$/MWh
and with constraint PG1  PG 2  PG 3  1000 MW
Rewriting as a function of  , PGi ( ), we have
PG1 ( ) 
  15
0.02
  18
PG3 ( ) 
0.025
PG2 ( ) 
  20
0.01
16
Lambda-Iteration Example, cont’d
Pick  L so
m
L
P
(

 Gi )  1000  0 and
i=1
m
H
P
(

 Gi )  1000  0
i=1
Try 
L
 20 then
m
 PGi (20)  1000

i 1
  15   20   18
0.02

0.01
Try  H  30 then

0.025
m
 1000  670 MW
 PGi (30)  1000
 1230 MW
i 1
17
Lambda-Iteration Example, cont’d
Pick convergence tolerance   0.05 $/MWh
Then iterate since  H   L  0.05
 M  ( H   L ) / 2  25
m
Then since
H
P
(25)

1000

280
we
set

 25
 Gi
i 1
Since 25  20  0.05
 M  (25  20) / 2  22.5
m
L
P
(22.5)

1000


195
we
set

 22.5
 Gi
i 1
18
Lambda-Iteration Example, cont’d
Continue iterating until  H   L  0.05
The solution value of  ,  , is 23.53 $/MWh
*
Once  * is known we can calculate the PGi
23.53  15
PG1 (23.5) 
 426 MW
0.02
23.53  20
PG2 (23.5) 
 353 MW
0.01
23.53  18
PG3 (23.5) 
 221 MW
0.025
19
Lambda-Iteration Solution Method


The direct solution only works well if the
incremental cost curves are linear and no generators
are at their limits
A more general method is known as the lambdaiteration
–
–
the method requires that there be a unique mapping
between a value of lambda and each generator’s MW
output
the method then starts with values of lambda below and
above the optimal value, and then iteratively brackets the
optimal value
20
Generator MW Limits



Generators have limits on the minimum and
maximum amount of power they can produce
Often times the minimum limit is not zero. This
represents a limit on the generator’s operation with
the desired fuel type
Because of varying system economics usually many
generators in a system are operated at their
maximum MW limits.
21
Lambda-Iteration with Gen Limits
In the lambda-iteration method the limits are taken
into account when calculating PGi ( ) :
if PGi ( )  PGi ,max then PGi ( )  PGi ,max
if PGi ( )  PGi ,min then PGi ( )  PGi ,min
22
Lambda-Iteration Gen Limit Example
In the previous three generator example assume
the same cost characteristics but also with limits
0  PG1  300 MW
100  PG2  500 MW
200  PG3  600 MW
With limits we get
m
 PGi (20)  1000
i 1
 PG1 (20)  PG 2 (20)  PG 3 (20)  1000
 250  100  200  450 MW (compared to -670MW)
m
 PGi (30)  1000
i 1
 300  500  480  1000  280 MW
23
Lambda-Iteration Limit Example,cont’d
Again we continue iterating until the convergence
condition is satisfied. With limits the final solution
of  , is 24.43 $/MWh (compared to 23.53 $/MWh
without limits). The presence of limits will always
cause  to either increase or remain the same.
Final solution is
PG1 (24.43)  300 MW
PG2 (24.43)  443 MW
PG3 (24.43)  257 MW
24
Lambda-Iteration Limit Example,cont’d
Again we continue iterating until the convergence
condition is satisfied. With limits the final solution
of  , is 24.43 $/MWh (compared to 23.53 $/MWh
without limits). The presence of limits will always
cause  to either increase or remain the same.
Final solution is
PG1 (24.43)  300 MW
PG2 (24.43)  443 MW
PG3 (24.43)  257 MW
25
Lambda-Iteration Limit Example,cont’d
Again we continue iterating until the convergence
condition is satisfied. With limits the final solution
of  , is 24.43 $/MWh (compared to 23.53 $/MWh
without limits). The presence of limits will always
cause  to either increase or remain the same.
Final solution is
PG1 (24.43)  300 MW
PG2 (24.43)  443 MW
PG3 (24.43)  257 MW
26
Thirty Bus ED Example
Case is economically dispatched without considering
the incremental impact of the system losses
27
Back of Envelope Values

Often times incremental costs can be approximated
by a constant value:
–
–
–
–
$/MWhr = fuelcost * heatrate + variable O&M
Typical heatrate for a coal plant is 10, modern
combustion turbine is 10, combined cycle plant is 7 to 8,
older combustion turbine 15.
Fuel costs ($/MBtu) are quite variable, with current
values around 2 for coal, 7 for natural gas, 0.5 for
nuclear, probably 10 for fuel oil.
Hydro costs tend to be quite low, but are fuel (water)
constrained
28
Aside: Levelized Cost of Generation
Technology
$/MWh (2007 Dollars) (IOU)
Advanced Nuclear
104
Wind – Class 5
67
Solar – Photovoltaic
686
Solar – Concentrating
434
Solar – Parabolic Trough
281
Ocean Wave (Pilot)
838
Small Scale Hydro
118
Geothermal
63
Keep in mind these numbers involve LOTs of assumptions
that can drastically affect the value, and that many
technology costs are site dependent.
Source: California Energy Commission:
http://energyalmanac.ca.gov/electricity/levelized_costs.html
29
Inclusion of Transmission Losses



The losses on the transmission system are a function
of the generation dispatch. In general, using
generators closer to the load results in lower losses
This impact on losses should be included when
doing the economic dispatch
Losses can be included by slightly rewriting the
Lagrangian:
L(PG ,  ) 
m
m
i 1
i 1
 Ci ( PGi )   ( PD  PL ( PG )   PGi )
30
Impact of Transmission Losses
This small change then impacts the necessary
conditions for an optimal economic dispatch
L(PG ,  ) 
m
m
i 1
i 1
 Ci ( PGi )   ( PD  PL ( PG )   PGi )
The necessary conditions for a minimum are now
L(PG ,  )
PGi
dCi ( PGi )
PL ( PG )

  (1 
)0
dPGi
PGi
m
PD  PL ( PG )   PGi  0
i 1
31
Impact of Transmission Losses
Solving each equation for  we get
dCi ( PGi )
PL ( PG )
  (1 
0
dPGi
PGi
dCi ( PGi )
1
 
 PL ( PG )  dPGi
1  P


Gi 
Define the penalty factor Li for the i th generator
1
Li 
 PL ( PG ) 
1  P


Gi 
The penalty factor
at the slack bus is
always unity!
32
Impact of Transmission Losses
The condition for optimal dispatch with losses is then
L1IC1 ( PG1 )  L2 IC2 ( PG 2 )  Lm ICm ( PGm )  
1
Since Li 
if increasing PGi increases
 PL ( PG ) 
1  P


Gi 
PL ( PG )
the losses then
 0  Li  1.0
PGi
This makes generator i appear to be more expensive
(i.e., it is penalized). Likewise Li  1.0 makes a generator
appear less expensive.
33
Calculation of Penalty Factors
Unfortunately, the analytic calculation of Li is
somewhat involved. The problem is a small change
in the generation at PGi impacts the flows and hence
the losses throughout the entire system. However,
using a power flow you can approximate this function
by making a small change to PGi and then seeing how
the losses change:
PL ( PG ) PL ( PG )

PGi
PGi
1
Li 
PL ( PG )
1
PGi
34
Two Bus Penalty Factor Example
PL ( PG )
 0.0387
PG 2
L2  0.9627
PL ( PG ) 0.37 MW

 0.037
PGi
10MW
L2  0.9643
35
Thirty Bus ED Example
Because of the penalty factors the generator incremental
costs are no longer identical.
36
Area Supply Curve
The area supply curve shows the cost to produce the
next MW of electricity, assuming area is economically
dispatched
10.00
7.50
Supply
curve for
thirty bus
system
5.00
2.50
0.00
0
100
200
Total Area Generation (MW)
300
400
37
Economic Dispatch - Summary


Economic dispatch determines the best way to
minimize the current generator operating costs
The lambda-iteration method is a good approach for
solving the economic dispatch problem
–
–


generator limits are easily handled
penalty factors are used to consider the impact of losses
Economic dispatch is not concerned with
determining which units to turn on/off (this is the
unit commitment problem)
Economic dispatch ignores the transmission system
limitations
38