20-Mar-24
Generation with Limited
Energy Supply
Dr Naeem Iqbal
Generation with Limited
Energy Supply
1 Introduction
2 Fuel Scheduling
3 Take-or-Pay Fuel Supply Contract
4 Complex Take-or-Pay Fuel Supply Models
4.1 Hard Limits and Slack Variables
5 Fuel Scheduling by Linear Programming
6 Introduction to Hydrothermal Coordination
6.1 Long-Range Hydro-Scheduling
6.2 Short-Range Hydro-Scheduling
7 Hydroelectric Plant Models
8 Scheduling Problems
8.1 Types of Scheduling Problems
8.2 Scheduling Energy
9 The Hydrothermal Scheduling Problem
9.1 Hydro-Scheduling with Storage Limitations
9.2 Hydro-Units in Series (Hydraulically Coupled)
9.3 Pumped-Storage Hydroplants
10 Hydro-Scheduling using Linear Programming
1
20-Mar-24
Introduction
We remove the assumption of economic dispatch and unit
commitment that fuel is not limited.
We also deals with water restrictions for hydro plants.
Procurement of fuels is through markets with some risk of
volume or price liquidity.
Hydro facilities are often limited to the storage limitations of the
reservoir, flow limitations for navigation or for irrigation, or level
change limitations for safety restrictions.
Of greatest concern when scheduling generation with limited
fuel or water are those situations when there is limited fuel or
water and the generator cannot be operated at full output for all
periods of time.
Fuel Scheduling
Economic Dispatch
Unristricted
Limited Energy Resources
Concepts involving slack variables and
penalty functions are introduced to
allow solution under certain conditions.
2
20-Mar-24
Take or Pay Gas Contract
Purchase a specific number of cubic feet of
gas for a fix price
Contract specifies a time period for the gas to
be taken
If buyer does not take all the gas purchased
the unused gas remains with the seller.
There is no refund for the unused gas.
Summary: Buyer pays fixed amount for gas
whether it uses the gas or not.
Take or Pay Gas Contract
Assume there are N normally fueled thermal plants plus one turbine
generator, fueled under a “take-or-pay” agreement. We will interpret this
type of agreement as being one in which the utility agrees to use a
contracted amount of fuel during a period (the “take”) and it agrees to pay
the minimum charge. This last clause is the “pay” part of the “take-or-pay”
contract.
While this unit’s cumulative fuel
consumption is below the minimum, the
system excluding this unit should be
scheduled to minimize the total fuel cost,
subject to the constraint that the total
fuel consumption for the period for this
particular unit is equal to the specified
amount.
3
20-Mar-24
Mathematically, the problem is as follows:
We wish to determine the
minimum production cost for units
1 to N subject to constraints that
ensure that fuel consumption is as
subject to contracted and also subject to the
set of constraints to ensure that
power supplied is within limits
each interval.
and
is constant because the total fuel to be
used in the “T” plant is fixed.
4
20-Mar-24
The Lagrange function is
For any given time period, j = k,
𝛾 has the units of a “fuel price” expressed in volume units rather
than MBtu as we have used up to now. Because of this, 𝛾 is often
referred to as a “pseudo-price” or “shadow price.”
𝛾 would be expected to be a constant value over all the time
periods. This is true unless the fuel-limited machine
is constrained by fuel storage limitations.
5
20-Mar-24
Gamma search method.
6
20-Mar-24
7
20-Mar-24
Operating cost of the composite unit
over the entire 24-h period is
52,128.03 $. The total gas
consumption is 21.8 × 106 ft3.
Since the gas-fired plant must burn
40 × 106 ft3 of gas, the cost will be
2.0 $/1000 ft3 × 40.106 ft3 , which is
80,000 $ for the gas. Therefore, the
total cost will be 132,128.03 $.
The gamma search method was used with 𝛾 values ranging from 0.500 to 0.875.
The final value for 𝛾 is 0.8742 $/ccf with an optimal schedule as shown in Table
5.3. This schedule has a fuel cost for the composite unit of 34,937.47 $. Note
that the gas unit is run much harder and that it does not hit
either limit in the optimal schedule. Further, note that the total cost is now
34,937.47$ + 80,000$ = 114,937.4$
8
20-Mar-24
COMPLEX TAKE-OR-PAY
FUEL SUPPLY MODELS
Hard Limits and Slack Variables
These may be added to the Lagrangian by the use of two constraint
functions and two new variables called slack variables
where S1j and S2j are slack variables that may take on any real value
including 0.
COMPLEX TAKE-OR-PAY
FUEL SUPPLY MODELS
The new Lagrangian then becomes
Now, the first partial derivatives for the kth
period are
when the constrained variable (P Tk in this
case) is within bounds, the new Lagrange
multipliers 𝛼1k = 𝛼2k = 0 and S1k and S2k
are nonzero.
When the variable is limited, one of the
slack variables, S1k or S2k, becomes 0, and
the associated Lagrange multiplier will take
on a nonzero value.
9
20-Mar-24
INTRODUCTION TO HYDROTHERMAL
COORDINATION
the hydroelectric plants may very well be coupled both electrically
(i.e., they all serve the same load) and hydraulically (i.e., the
water outflow from one plant may be a very significant portion
of the inflow to one or more other, downstream plants).
Long-Range Hydro-Scheduling
The long-range hydro-scheduling problem involves the
long-range forecasting of water availability and the scheduling of
reservoir water releases (i.e., “drawdown”) for an interval of time that
depends on the reservoir capacities.
Short-Range Hydro-Scheduling
Short-range hydro-scheduling (1 day to 1 week) involves the hour-by-
hour scheduling of all generation on a system to achieve minimum
production cost for the given time period. In such a scheduling problem,
the load, hydraulic inflows, and unit availabilities are assumed known.
10
20-Mar-24
HYDROELECTRIC PLANT
MODELS
11
20-Mar-24
One thousand cubic feet of water falling a distance of 42.5 ft has the
energy equivalent to 1 kWh. Correspondingly, 42.5 ft3 of water falling
1000 ft also has the energy equivalent to 1 kWh.
SCHEDULING PROBLEMS
Types of Scheduling Problems
Systems without any thermal generation
Hydrothermal systems where the hydroelectric system is by far the
largest component
The largest category of hydrothermal systems includes those
where there is a closer balance between the hydroelectric and
thermal generation resources and those where the hydroelectric
system is a small fraction of the total capacity.
12
20-Mar-24
SCHEDULING PROBLEMS
Scheduling Energy
The hydroplant can supply the load by
itself for a limited time. That is, for any
time period j,
However, the energy available from the
hydroplant is insufficient to meet the load:
We would like to use up the entire amount of energy from the hydroplant
in such a way that the cost of running the steam plant is minimized.
The steam-plant energy required is
13
20-Mar-24
the scheduling problem becomes
subject to
This means that the steam plant
should be run at constant incremental
cost for the entire period it is on. Let
this optimum value of steam-generated
power be P*s , which is the same
for all time intervals the steam unit is
on.
14
20-Mar-24
The total cost over the interval is
Let the steam-plant cost be expressed as
which means the unit should be operated at its maximum efficiency
point long enough to supply the energy needed, E.
15
20-Mar-24
where fc is the fuel cost, then the heat rate is
and the heat rate has a minimum when
giving best efficiency at
16
20-Mar-24
17
20-Mar-24
THE HYDROTHERMAL
SCHEDULING PROBLEM
Hydro-Scheduling with Storage Limitations
A more general and basic short-
term hydrothermal scheduling
problem requires that a given
amount of water be used in
such a way as to minimize the
cost of running the thermal
units.
We assume that the hydroplant is not
sufficient to supply all the load demands
during the period and that there is a
maximum total volume of water that may
be discharged throughout
the period of Tmax hours.
subject to
18
20-Mar-24
Other constraints could be imposed, such as
19
20-Mar-24
Suppose we add the network losses to the problem. Then at each hour,
with resulting coordination equations (hour k):
20
20-Mar-24
21
20-Mar-24
Hydro-Units in Series (Hydraulically Coupled)
22
20-Mar-24
All equations must apply for j = 1 … jmax.
23
