A Simple Unit Commitment Example: Daniel Kirschen

A Simple Unit Commitment Example
Daniel Kirschen
Unit Data
Min
up
Min
down
No-load
cost
Marginal
cost
Start-up
cost
(h)
(h)
()
(/MWh)
()
250
10
1,000
ON
50
100
12
600
OFF
10
50
20
100
OFF
Pmin
Pmax
(MW)
(MW)
150
Unit
Initial
status
Demand Data
Hourly Demand
350
300
250
200
Load
150
100
50
0
1
Hours
Reserve requirements are not considered

3
Feasible Unit Combinations (states)

Combinations
Pmin
Pmax
210
400
200
350
160
300
150
250
60
150
50
100
10
50
150
300
200
Transitions between feasible combinations

1
A
Initial State
Infeasible transitions: Minimum down time of unit A

1
A
Initial State
TD
TU
Infeasible transitions: Minimum up time of unit B
Initial State
TD
TU
Feasible transitions
Initial State
Operating costs
1
5
Economic dispatch
10
State
Load
PA
PB
PC
Cost
150
150
1500
300
250
50
3500
300
250
50
3100
300
240
50
10
3200
200
200
2000
200
190
10
2100
200
150
50
2100
Unit
Pmin
Pmax
No-load cost
Marginal cost
150
250
10
50
100
12
10
50
20
Operating costs
4
3200
3
3100
7
2100
2
3500
6
2100
1
1500
5
2000
11
Start-up costs
4
3200
700
600
100
1
12
Unit
Start-up cost
1000
600
100
1
1500
3
3100
2
3500
0
0
600
0
0
7
2100
6
2100
5
2000
Accumulated costs
5400
4
3200
1500
0
1
1500
5200
700
3
3100
600 5100
2
3500
100
0
0
600
0
0
7300
7
2100
7200
6
2100
7100
5
2000
Note: to get the lowest cost for state 7, we use Bellmans

optimality principle
13
Total costs
7300
7
7200
6
7100
5
Lowest total cost
14
Optimal solution
2
7100
1
15
Notes
This example is intended to illustrate the principles of unit commitment
Some constraints have been ignored and others artificially tightened to

simplify the problem and make it solvable by hand
Therefore it does not illustrate the true complexity of the problem
The solution method used in this example is based on dynamic

programming. This technique is no longer used in industry because it only
works for small systems (< 20 units)
The program that you will use in the lab is based on mixed integer
programming
16

A Simple Unit Commitment Example: Daniel Kirschen

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

A Simple Unit Commitment Example: Daniel Kirschen

Uploaded by

Copyright:

Available Formats

A Simple Unit Commitment Example

Reserve requirements are not considered

Feasible Unit Combinations (states)

Transitions between feasible combinations

Infeasible transitions: Minimum down time of unit A

Infeasible transitions: Minimum up time of unit B

Note: to get the lowest cost for state 7, we use Bellmans

This example is intended to illustrate the principles of unit commitment

Some constraints have been ignored and others artificially tightened to

Therefore it does not illustrate the true complexity of the problem

The solution method used in this example is based on dynamic

You might also like