Scribd
Upload
28 views37 pages

Unit Commitment

The document discusses unit commitment in power systems. Unit commitment involves deciding which generators to start up and connect to the network to meet changing load levels over time. The objective is to minimize costs by choosing the most economic combination of units to operate at each time interval while satisfying demand. This is formulated as a multi-stage optimization problem that is solved using dynamic programming.

Uploaded by

غيلان الحاشدي
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
28 views37 pages

Unit Commitment

The document discusses unit commitment in power systems. Unit commitment involves deciding which generators to start up and connect to the network to meet changing load levels over time. The objective is to minimize costs by choosing the most economic combination of units to operate at each time interval while satisfying demand. This is formulated as a multi-stage optimization problem that is solved using dynamic programming.

Uploaded by

غيلان الحاشدي
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 37

ECONOMIC OPERATION OF POWER

SYSTEMS
13.7

UNIT COMMITMENT
Because the total load of the power system varies
throughout the day and reaches a different peak value
from one day to another, the electric utility has to
decide in advance which generators to start up and
when to connect them to the network-and the sequence
in which the operating units should be shut down and
for how long.
The computational procedure for making such
decisions is called unit commitment, and a unit
when scheduled for connection to the system is
said to be committed.
there are many factors of practical significance
which determine when units are scheduled on
and off to satisfy the operating needs of the
system, economics of operation is of major
importance.
We said before that the total load of power system varies
throughout the day,
So how can we predict load of the system over the future
time period?
(Electrical load forecasting)
Forecast or predict the load is based on the
historical load in the past.
After we predict the future loads, we subdivide the 24-h day into
discrete intervals or stages and the predicted load of the system will be
considered constant over each interval. Fig. below

Sketch it
After we predicted all load levels over their intervals , how can
we choose which unit will be operated during a specific
interval or stage?!
The unit commitment procedure then searches for the most
economic feasible combination of generating units to serve
the forecast load of the system at each stage of the load cycle.

What does combination mean?


The power system with K generating units (no two identical) must have at
least one unit on-line to supply the system load which is never zero over the
daily load cycle. If each unit can be considered either on (denoted by 1) or
off (denoted by 0), there are candidate combinations to be examined in each
stage of the study period.
For example, if K = 4, the 15 theoretically possible combinations for each
interval are
But, Are all combinations feasible?
Of course not, not all combinations are feasible because of the
constraints imposed by the load level and other practical
operating requirements of the system. For example, a
combination of units of total capability less than 1400 MW
cannot serve a load of 1400 MW or greater.
Mathematical
formulation of the unit
commitment problem
1 Let us set

and then represents combination of interval (k + 1). If k equals


1 and i equals 9 in the four-unit example, the combination
means that only
Units 1 and 2 are on-line during the first time interval.
2

The production cost incurred in supplying power over any


interval of the daily load cycle depends on which
combination of units is on-line during that interval.
For a given combination the minimum production cost
equals the sum of the economic dispatch costs of the
individual units.
is the minimum production cost of combination
3
Transition cost
which is the cost associated with changing from one
combination of power-producing units to another combination.

Start-up cost Shut-down cost


Therefore, transition cost links the scheduling decision of
any one interval to the scheduling decisions of all the
other intervals of the load cycle. Accordingly, the
problem of minimizing costs at one stage is tied to the
combinations of units chosen for all the other stages, and
we say that unit commitment is a multistage or dynamic
cost minimization
problem.
So, as we have seen before the cost associated with any stage
k has two components given by

which is the combined transition and production cost


incurred by combination during interval k plus the
transition cost to combination of the next
interval. For a given combination the minimum production
cost equals the sum of the economic dispatch costs of the
individual units.
is the minimum production cost of combination
For ease of explanation it is assumed that the system load
levels at the beginning and end of the day are the same.
Consequently, it is reasonable to expect that the state of the
system is the same at the beginning and at the end
of the day. Because of this, when k = N, the transition cost
becomes zero.

,so we evaluate one decision at a time beginning with the


final stage N.
Then, we carry the minimum cumulative cost function
backward in time to stage k to find the minimum cumulative
cost for the feasible combination
of stage f.
the minimum cumulative cost at stage k

where k ranges from 1 to N.


If we agree that combination is the best combination for
stage ( N - 1 ), then
by searching among all the feasible combinations
of the final stage N, we can find
where is the minimum cumulative cost of the final two
stages starting with combination
and ending with combination ; the cumulative cost of stage
N equals the production cost since
there is no further transition cost involved. The
search for the minimum-cost decision is made over all
feasible combinations at stage N.
Similarly, starting with the combination at interval (N - 2).
the minimum cumulative cost of the final three stages of the
study period is given by

where the search is now made among the feasible


combinations of stage (N - 1).
At each stage we build a table of results until we reach
stage 1. The minimum cumulative cost decisions are
recovered as we sweep from stage 1 to stage N searching
through the tables already calculated for each stage. This
computational procedure, known as dynamic
programming.
Programming
summary
TH
AN
K U
Y O

You might also like