Scribd
Upload
11 views48 pages

Mod 4-UNIT COMMITMENT

The document discusses unit commitment and dynamic programming approaches for solving unit commitment problems. It provides examples of using dynamic programming to determine the minimum cost generation schedule for a power system with multiple generating units. The examples calculate the optimal unit commitment for different load levels using a recursive cost function in a dynamic programming formulation.

Uploaded by

Appasabgouda Biradar
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
11 views48 pages

Mod 4-UNIT COMMITMENT

The document discusses unit commitment and dynamic programming approaches for solving unit commitment problems. It provides examples of using dynamic programming to determine the minimum cost generation schedule for a power system with multiple generating units. The examples calculate the optimal unit commitment for different load levels using a recursive cost function in a dynamic programming formulation.

Uploaded by

Appasabgouda Biradar
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/ 48

GETTING STARTED WITH

Power System Analysis -2

Mallikarjun G Hudedmani
EEE Dept KLEIT Hubballi
[email protected]
UNIT COMMITMENT
Simple Enumeration / Brute Force method
Simple Enumeration / Brute Force method
Peak Valley Pattern of Load
Simple Enumeration / Brute Force method
Simple Load Curve
Simple Shutdown Rule
Simple Shutdown Rule
CONSTRAINTS IN UNIT COMMITMENT
CONSTRAINTS IN UNIT COMMITMENT
CONSTRAINTS IN UNIT COMMITMENT
Spinning Reserve
Spinning Reserve
Thermal constraints
Dynamic Programming
Dynamic programming has many advantages over the enumeration scheme, the chief
advantage being a reduction in the dimensionality of the problem. Suppose we have 4
units in a system and any combination of them could serve the (single) load. There
would be a maximum of 24 - 1 = 15 combinations to test. However, if a strict priority
order is imposed, there are only four combinations to try:
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
The imposition of a priority list arranged in order of the full-load average cost rate
would result in a theoretically correct dispatch and commitment only if:
1. No load costs are zero.
2. Unit input-output characteristics are linear between zero output and full load.
3. There are no other restrictions.
4. Start-up costs are a fixed amount.
1) A state consists of a group of units with only precise units in service at a time and the
remaining off-line.
2) While the unit is in off state the start-up cost of a unit is independent of the time
specifically it remains fixed.
3) For closing the unit there will be no cost involved.
4) The order of precedence is firm and a small quantity of power must be in operation
in each interval.
Dynamic Programming
Let a cost function FN (x) be defined as follows:
FN (x) = the minimum cost in Rs/hr of generating x MW by N units,
fN (y) = cost of generating y MW by the Nth unit
FN-1 (x — y) = the minimum cost of generating (x — y) MW by the remaining (N — 1) units
Now the application of DP results in the following recursive relation

Using the above recursive relation, we can easily determine the combination of units,
yielding minimum operating costs for loads ranging in convenient steps from the minimum
permissible load of the smallest unit to the sum of the capacities of all available units. In
this process the total minimum operating cost and the load shared by each unit of the
optimal combination are automatically determined for each load level.

The use of DP for solving the UC problem is best illustrated by means of an example.
Consider a sample system having four thermal generating units with parameters listed in
Table . It is required to determine the most economical units to be committed for a load of
9 MW. Let the load changes be in steps of 1 MW.
Forward Dynamic Programming
Forward Dynamic Programming
Forward Dynamic Programming
Example : The cost curves of two plants are
Find the optimum generation for λ =
22, λ = 25, and λ =30
Example 3.15: For the system shown in Fig.
Bus-3 as the reference bus with a voltage of
1.2 ∠0 p.u.,find the loss formula coefficients
of the system in p.u. and in actual units, if
the branch currents and impedances are
THANK YOU ALL

I am very much thankful to those authors and publishers of various articles


and books from those the material is used to present

You might also like