Unit Commitment
Introduction
Gen 1
F1
P1
Gen 2
F2
----
----
P2
PD
Gen N
FN
PN
4/30/2015
4/30/2015
Definition
The process of determining a schedule of
generating units that yields the minimum total
production cost and satisfies all constraints is
called Unit Commitment (UC).
Formulation of UC problem
A.
Objective function
N
Min
F [ Fi ( pi ,t ) I i ,t SU i I i ,t (1 I i ,t 1 )]
i 1 t 1
Fi ( pi ,t ) ai bi pi ,t ci p
2
i ,t
HSU i ;
SU i
CSU i ;
4/30/2015
Constraints
The UC problem is subjected to
1) Equality constraint
2) Inequality constraints
3) Spinning reserve constraint
4) Ramp rate limits
5) Minimum up and minimum down time
6) Must run units
4/30/2015
Existing methods
1.
2.
3.
4.
5.
4/30/2015
Steps
Compute the ALFC for all units and find
priority list
Example
Cost data of four units system
Limitations
However, the UC solution may not be the
optimal schedule because start-up cost and
ramp rate constraints are not included in
determining the priority commitment order.
AFLC does not adequately reflect the operating
cost of generating units when they do not
operate at the full.
4/30/2015
13
DYNAMIC PROGRAMMING
The dynamic programming (DP) method
consists in implicitly enumerating feasible
schedule alternatives and comparing them in
terms of operating costs.
Thus DP has many advantages over the
enumeration method, such as reduction in the
dimensionality of the problem.
Fcost (k , l )
Pcost (k , l )
S (k 1, l : k , l )
Start
K=1
Dynamic Programming
K=K+1
K=M
(last hour)
Stop
4/30/2015
19
LIMITATIONS
The DP does not take into account the coupling
of adjacent time periods.
The DP does not handle the minimum up and
down time constraints unless some heuristic
procedures were included.
The DP suffers from Curse of dimensionality.
are
solved
0 = d/dx1(0.25x21 + 15 - x1l1)
if the value of x1 satisfying the above falls
outside the 0 < x1 < 10, we force x1 to the
limit.
If the term in the brackets is > 0, set U1 to 0,
otherwise keep it 1
0 = d/dx2(0.255x22 + 15 - x2l1)
same as above
J min [ Fc ( P ) SU (1 U )]U
*
t 1 n1
t
i ,n
t
n
t
i ,n
t
i ,n
t
i ,n
Dual sub-problem
The dual sub problem is to
find the maximum cost received by maximizing the
Lagrangian function with respect to the Lagrange
multipliers
t 1
n 1
l ( PDt PntU nt )
T
t 1
n 1
( PDt R t Pnt,maxU nt )
The data for the three - unit, four - hour unit commitment
problem are as below, which is solved with Lagrange relaxation
technique
Limitations
Inappropriate method of updating the
Lagrangain multipliers may cause the solution
adjustment to oscillate around the global
optimum.
LR method tends to over-commit generating
units when identical generating units with the
same cost characteristics exist in the system.