Scribd
Upload
99 views29 pages

Unit Commitment: K. Saravanan

The unit commitment problem involves determining the optimal start-up and shut-down schedule of generating units to meet forecasted demand over a short-term period, while satisfying operating constraints. It aims to schedule units economically and is a complex combinatorial optimization problem. Dynamic programming and priority list methods are common solution approaches that consider costs like production, start-up, and transition costs to find the lowest-cost generation schedule.

Uploaded by

habte gebreial shrashr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
99 views29 pages

Unit Commitment: K. Saravanan

The unit commitment problem involves determining the optimal start-up and shut-down schedule of generating units to meet forecasted demand over a short-term period, while satisfying operating constraints. It aims to schedule units economically and is a complex combinatorial optimization problem. Dynamic programming and priority list methods are common solution approaches that consider costs like production, start-up, and transition costs to find the lowest-cost generation schedule.

Uploaded by

habte gebreial shrashr
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 29

Chapter 2.

2
UNIT COMMITMENT

K. SARAVANAN
2
3

• The unit commitment economically schedules generating units


over a short-term planning horizon subject to the satisfaction of
demand and other system operating constraints.

• It involves determining start-up and shut-down schedule of units


to be used to meet the forecasted demand , over a future short term
period.

• belongs to the class of complex combinatorial optimization


problems..
4
An Example
• Consider 3 units shown below:
Unit 1: Min=150MW, Max=600MW,H1=510+7.2P1+0.00142P12

Unit 2: Min=100MW, Max=400MW,


H2=310+7.85P2+0.00194P22.

Unit 3: Min=50 MW, Max=200 MW,H3= 78+7.97P3+0.00482P32.

Load is 550 MW.

Fuel cost1=1.1 R/Mbtu, Fuel cost2=1.0 R/MBtu


Fuel cost3=1.2 R/Mbtu. What is the combination of units to
supply the load most economically?

solution: Refer to class notes


5

S. Unit Unit Unit Pmax Pmin P1,P2,P3 F1,F2, Ft0tal


N0 1 2 3 F3

0 0 0 0 0 0 Infeasible

1 0 0 1 200 50 Infeasible

2 0 1 0 400 100 Infeasible

3 0 1 1 600 150 0,400,150 0,3760,1658 5418

4 1 0 0 600 150 550,0,0 5389,0,0 5389

5 1 0 1 800 200 500,0,50 4911,o,586 5497

6 1 1 0 1000 250 295,255,0 3030,2440,0 5471

7 1 1 1 1200 300 267,233,50 2787,2244,586 5617


6
7

Constraints in Unit Commitment


• Spinning Reserve
• Thermal Constraints
• Other Constraints
8

Spinning reserve
• There may be sudden increase in load, more than what was
predicted.
• Further there may be a situation that one generating unit may
have to be shut down because of fault in generator or any of its
auxiliaries.
• Some system capacity has to be kept as spinning reserve
i) To meet an unexpected increase in demand and
ii) To ensure power supply in the event of any generating unit
suffering a forced outage.
9

Unit Unit Unit Spinning


capacity output Reserve
1 1000 900 100
2 800 420 380
3 800 420 380
4 1200 1040 160
5 600 310 290
10

Thermal Constraints
Thermal units undergo only gradual temperature changes.

 Minimum Up time: When a thermal unit is brought in, it


cannot be turned off immediately. Once it is committed, it has
to be in the system for a specified minimum up time

 Minimum Down time: When a thermal unit is decommitted,


it cannot be turned on immediately. It has to remain
recommitted for a specified minimum down time.

 Crew Constraints: A plant always has two or more generating


units. It may not be possible to turn on more than one generating
unit at the same time due to non-availability of operating personnel.
11

Start up cost
• Energy expended to bring the unit on-line.
• Cooling:
Allows the units boiler to cool down and then heat back
up to operating temperature in time for a scheduled turn-
on.
• Banking:
Requires that sufficient energy be input to the boiler to
just maintain operating temperature
12

Start –up cost when cooling


t

cc (1   )  F  c f

where

cc = cold-start cost (MBtu)

F = Fuel cost
cf =Fixed cost
 = Thermal time constant for the Unit
t = time (h) the unit was cooled
13

• Start-up cost when banking

ct  t  F  c f

where

ct = cost (MBtu/h) of maintaining unit


at operating temperature
14

Time
Start up
dependent start-up cost
Cooling
cost

Banking

Time
15

Other Constraints
1. Hydro-Constraints: Most of the systems have
hydroelectric units also. The operation of hydro units, depend
on the availability of water. Moreover, hydro-projects are
multipurpose projects. Irrigation requirements also determine
the operation of hydro plants.

2. Must run constraint: Sometime it is a must to run one or


two units from the consideration of voltage support and system
stability.

3. Fuel Constraints: Some plants cannot be operated due to


poor fuel supply.
16

Optimal scheduling of Hydrothermal


17
18

Solution Methods
• Priority list schemes
• Dynamic Programming
• Lagrange Relaxation
19

Priority List Method


• It consists of priority list of units to be committed.
• Full load average production cost of each unit is calculated.
• Then in the order of ascending costs, the units are arranged for
commitment.
20

Limitations of Priority List Scheme


• No load costs are zero.
• Unit input-output characteristics are linear between zero output and full load.
• There are no other restrictions.
• Start up costs are a fixed amount.
21

Full load average production cost


• In this method the full load average production
cost of each unit is calculated first. Using this,
priority list is prepared.
22

Example
The following are data pertaining to three units in a plant.
Unit 1: Min = 150MW, Max. = 600 MW
C1 = 5610 + 79.2 P1 + 0.01562 P12 $ / h

Unit 2: Min = 100MW ,Max. = 400 MW


C2 = 3100 + 78.5 P2 + 0.0194 P22 $ / h

Unit 3: Min = 50MW ,Max. = 200 MW


C3 = 936 + 95.64 P3 + 0.05784 P32 $ / h

Obtain the priority list using full load average production cost
of each unit .
23
24

Optimal Combinations
Combination Min MW Max MW
2+1+3 300 1200
2+1 250 1000
2 100 400
25

Dynamic Programming for UC


assumptions
• A state consists of an array of units with specified
units operating and the rest off-line.
• The start up cost of a unit is independent of the
time it has been off-lined (i.e., it is a fixed
amount).
• There are no costs for shutting down a unit.
• There is a strict priority order, and in each interval
a specified minimum amount of capacity must be
operating.
26

Priority 1 unit
Priority 1 unit + Priority 2 unit
Priority 1 unit + Priority 2 unit + Priority 3 unit
Priority 1 unit + Priority 2 unit + Priority 3 unit + Priority 4 unit
27

Forward DP Approach
The initial conditions are easily specified
Previous history of the unit can be computed at each stage

Fcost (K, I) = Min [Pcost (K, I) + Scost (K-1, L: K, I) + Fcost (K-1, L)]
where
Fcost (K, I) =least total cost to arrive at state (K, I)
Pcost (K, I) = production cost for state (K, I).
Scost (K-1, L: K, I) = transition cost for state (K-1, L)
to state (K, I)
where state (K, I) is the Ith combination in hour K.
28
29

Recursive Algorithm to compute


the minimum cost

Fcost ( K , I )  min[ Pcost ( K , I )  Scost ( K  1, L : K , I )  Fcost ( K  1, L)]


L
where
Fcost ( K , I )  least total cost to arrive at state( K , I )
Pcost ( K , I )  production cost for state( K , I )
S cost ( K  1, L : K , I )  transition cost from state ( K  1, L) to ( K , I )

You might also like