Impact of Demand Side Management On Unit Commitment Problem: Manisha Govardhan Ranjit Roy
Impact of Demand Side Management On Unit Commitment Problem: Manisha Govardhan Ranjit Roy
Impact of Demand Side Management On Unit Commitment Problem: Manisha Govardhan Ranjit Roy
Abstract— Growing energy demand and its remedial solution is a generated power among the committed units while satisfying
great challenge of power industries. This paper deals with several constraints.
demand side management in unit commitment using two essential
approaches of energy balance (i.e. energy shifting) and load Recently, many demand response program has been reported
reduction during peak hours. Demand side management is a for DSM. Furthermore, a few demand response based unit
crucial job of reshaping the inconsistent load demand either by commitment (DRUC) models are discussed in literature. A
shifting demand from peak period to off-peak or low load period model of emergency demand response (EDRP) and
or reducing load demand during peak period. This ultimately interruptible load contracts (ILC) in UC problem is proposed in
results in energy saving and cost reduction of a system. A test [3] to minimize the energy consumption during the critical or
system of 26 generating units is considered for simulation study peak period of the day. The study has been carried out with a
using gbest artificial bee colony algorithm. The test results load demand of Iranian grid and developed EDRP cost
confirm significant savings in cost and energy consumption while component added to generation cost. Another UC problem
peak load demand is reduced. associated with DR program model (UCDR) to study the
environment and an economic effect of DR program is
Keywords- Demand response (DR); Demand side management suggested in [4]. These DRUC models have considered the cost
(DSM); Gbest artificial bee colony algorithm (GABC); Unit of DR in addition with the total cost.
commitment (UC) .
This paper considers direct load control (DLC) approach in
I. INTRODUCTION which operator autonomously decides for load flattening and
Demand side management (DSM) is a dynamic solution cost reduction. Two basic approaches of energy balance and
against emergent energy demand and fuel price, concern for peak load clipping is considered to enhance the load demand
climate change and seasonal uncertainty in load demand. profile and then UC problem has been solved with modified
Basically, DSM has been classified as direct load control load profile [5]. Gbest Artificial Bee Colony algorithm has
(DLC), indirect load control and local energy storage [1]. DLC been executed for simulation study of 26 generating units test
permits utility to regulate isolated customer’s load demand system.
independently; indirect DLC involves customer participation
for their load demand deviations according to the change in The construction of this paper is as follows: structure of UC
electricity price and local energy storage allows both customer with DSM policies and associated constraints has been
and utility to preserve energy during off-peak and low load described in Section II. Section III conveys brief introduction
period and utilize the same during peak period. of Gbest Artificial Bee Colony algorithm. The results for
different test cases are discussed and compared in Section IV.
DSM also has a great influence on deregulated electricity Finally, conclusion is drawn in Section V.
market [2]. In general, electricity price is low during off-peak
and low load period and high during peak period. DSM II. UC PROBLEM FORMULATION WITH DSM
encourages end user entities to shift their load demand from
peak to off-peak period or reduce energy consumption during A. Demand Side Management
peak period which in turn results in energy saving and cost Two different strategies of DSM namely energy balance
reduction. and peak load saving has been employed and their effect on
load demand profile has been studied [5]. This study is carried
Furthermore with DSM policies, optimal scheduling of
out with the assumption that DSM has been performed by
generated power is also again a challenging task. Hence the
goal of this paper is to solve UC problem considering DSM. system operator at remote end. From earlier energy demand
UC can be specifically outlined as a large-scale, nonlinear, and electricity price statistics, operator autonomously imposes
mixed integer combinatorial optimization problem which varying energy supply according to the change in electricity
involves two critical sub-problems of power industry namely price to enhance load profile and system cost.
unit commitment (UC) and economic load dispatch (ELD). UC
decides on/off status of generating units and ELD distributes a) Energy balance: The significance of energy balance is to
shift load demand from a peak period to low and off-peak
978-1-4799-2044-0/14/$31.00©2014IEEE
2014 International Conference on Control, Instrumentation, Energy & Communication 447
period to balance energy consumption of an entire day with As a result of energy balance and peak load saving DSM
noticeable cost benefit. policies, system operator tends to modify the original load
If energy price (EP) of a day is known then the operator demand using equation (1) and (3) respectively to obtain the
assumes average energy price as a reference energy price consistent load demand with reduced system cost.
(EPref) to calculate new load demand after implementing DSM
as shown in Figure 1. If EP of particular hour is less than B. System objective
EPref, then operator tends to increase load demand with an Cost minimization is an ultimate goal of solving UC
problem with appropriate scheduling of generated power
increment of Dup and if EP is higher than EPref, then the
among all committed units while handling several fundamental
operator will decrease the load demand by Ddown as shown in
constraints. The total cost (TC) is an accumulation of fuel cost
Figure 1(a). The new load demand after implementing DSM is
(FC), start-up cost (STC) and shut down cost (SDC). Shut
obtained as follows [5]:
down cost is a constant value and assuming zero in this study.
PL new( h ) = PL ( h ) + Dup ( h ) if EP( h ) < EPref (1)
Therefore the final objective function to be minimized is
formulated as [6]:
PL new( h ) = PL ( h ) − Ddown ( h ) if EP( h ) > EPref N H
min TC = ¦¦[ FCi ( Pi ( h ) ) + STCi (1 − ui ( h−1) )]ui ( h ) (4)
i =1 h =1
where Dup and Ddown are the upward and downward limits of
load demand variation from the base load demand where FCi(Pi(h)) is fuel cost of unit i at hour h, N is number of
respectively. Moreover, to maintain consistent load profile thermal units and H is total scheduled time horizon.
Dup and Ddown should sustain within specified limit. For The fuel cost function of a thermal unit can be expressed in
energy balance of a complete day following criteria must quadratic polynomial form as:
satisfy [5]. (5)
H H (2) FC (P ) = a + b (P ) + c (P ) 2
i i ( h) i i i ( h) i i ( h)
35
The ABC focuses on a cluster of honeybees and their food
EP ($)
finding habits. The bees are mainly classified into three groups 30
namely employed bees, onlookers and scouts [8]. In ABC, bees
fly to hunt food in multidimensional search space. Some bees 25
employed bees and they further search food source nearby the Fig. 2 Hourly Energy price
selected food source. If there is no enhancement in the food
source then scout bees fly and discover the new food source TABLE I GENERATION CAPACITY AND COST COEFFICIENTS
randomly without using experience. The algorithm steps are Unit Pmin Pmax a b c
(MW) (MW) ($/MW2) ($/MW) ($)
[9]: 1 2.4 12.0 0.02533 25.5472 24.3891
2 2.4 12.0 0.02649 25.6753 24.4110
Initialization 3 2.4 12.0 0.02801 25.8027 24.6382
Initial population P= [P1, P2, P3,…Pn] of randomly 4 2.4 12.0 0.02842 25.9318 24.7605
distributed solution is generated from the multi-dimensional 5 2.4 12.0 0.02855 26.0611 24.8882
6 4.0 20.0 0.01199 37.5510 117.5551
search space, where n is the size of optimized parameters and 7 4.0 20.0 0.01261 37.6637 118.1083
P1, P2, P3,…Pn are possible candidate solutions and each 8 4.0 20.0 0.01359 37.7770 118.4576
solution vector is specified as Pi= [P1,i P2,i P3,i … Pj,i ...Pn,i]. 9 4.0 20.0 0.01433 37.8896 118.8206
10 15.2 76.0 0.00876 13.3272 81.1364
Employed bee phase 11 15.2 76.0 0.00895 13.3538 81.2980
12 15.2 76.0 0.00910 13.3805 81.4681
Update process is carried out for each candidate solution Pi.
13 15.2 76.0 0.00932 13.4073 81.6259
In this process a new food source vi is given by: 14 25.0 100.0 0.00623 18.0000 217.8952
15 25.0 100.0 0.00612 18.1000 218.3350
vi j = Pi j + φi j ( Pij − Pkj ) + Ψij ( y j − Pi j ) (11) 16
17
25.0
54.25
100.0
155.0
0.00598
0.00463
18.2000
10.6940
218.7752
142.7348
18 54.25 155.0 0.00473 10.7154 143.0288
where φi j is a random number between -1 to 1, j € {1,2…n} 19 54.25 155.0 0.00481 10.7367 143.3179
20 54.25 155.0 0.00487 10.7583 143.5972
and Pk signifies the another randomly selected solution from 21 68.95 197.0 0.00259 23.0000 259.1310
the population. Ψi j is a random number between 0 to C and 22 68.95 197.0 0.00260 23.1000 259.6490
23 68.95 197.0 0.00263 23.2000 260.1760
C is a positive constant. yj denotes the jth element of global best 24 140.0 350.0 0.00153 10.8616 177.0575
solution. After completion of this phase the best obtained 25 100.0 400.0 0.00194 7.4921 310.0021
solution is stored. 26 100.0 400.0 0.00195 7.5031 311.9102
16
14
12
Fuel cost
10
0
0 20 40 60 80 100 120 140 160 180 200
Number of iterations
Fig. 4 Convergence characteristics of GABC for base case
2014 International Conference on Control, Instrumentation, Energy & Communication 450
Hour H14 H15 H16 H17 H18 H19 H20 H21 H22 H23 H24
Load 2550 2620 2650 2550 2530 2500 2550 2600 2480 2200 1840
U1 0.0 0.0 0.0 0.0 0.0 0.0 9.4 12.0 0.0 0.0 0.0
U2 0.0 0.0 0.0 0.0 0.0 0.0 10.7 8.6 0.0 0.0 0.0
U3 0.0 0.0 0.0 0.0 0.0 0.0 10.4 11.9 0.0 0.0 0.0
U4 0.0 0.0 0.0 0.0 0.0 0.0 10.1 12.0 0.0 0.0 0.0
U5 0.0 0.0 0.0 0.0 0.0 0.0 0.0 12.0 0.0 0.0 0.0
U6 0.0 0.0 0.0 0.0 0.0 0.0 0.0 14.8 0.0 0.0 0.0
U7 0.0 0.0 0.0 0.0 0.0 0.0 0.0 20.0 0.0 0.0 0.0
U8 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
U9 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0 0.0
U10 67.2 64.1 76.0 76.0 76.0 76.0 67.5 74.6 64.8 61.9 20.6
U11 45.7 76.0 76.0 76.0 70.9 75.4 76.0 72.2 51.8 65.8 55.3
U12 50.1 39.1 56.0 63.3 76.0 70.4 76.0 76.0 75.8 45.2 68.5
U13 69.1 73.1 76.0 76.0 15.2 76.0 76.0 76.0 58.0 37.0 15.6
U14 100.0 75.6 95.9 42.9 100.0 100.0 91.2 81.2 63.8 35.5 0.0
U15 84.8 100.0 100.0 73.6 99.1 91.2 97.7 57.7 99.5 56.04 0.0
U16 100.0 100.0 98.7 53.6 37.8 100.0 69.5 73.3 87.1 61.0 0.0
U17 155.0 155.0 155.0 118.6 150.4 153.7 155.0 155.0 129.7 154.7 107.3
U18 155.0 155.0 140.1 153.0 155.0 94.4 139.7 155.0 148.3 148.8 127.8
U19 144.1 150.8 155.0 155.0 128.3 155.0 134.5 155.0 155.0 155.0 139.6
U20 128.2 154.4 73.6 155.0 147.1 155.0 155.0 152.0 155.0 155.0 155.0
U21 122.9 188.7 131.3 69.2 167.0 93.0 151.9 113.6 151.1 73.9 0.0
U22 68.9 68.9 69.1 179.6 88.0 109.6 68.9 116.7 89.8 0.0 0.0
U23 108.9 68.9 197.0 108.0 68.9 0.0 0.0 0.0 0.0 0.0 0.0
U24 350.0 350.0 350.0 350.0 350.0 350.0 350.0 350.0 350.0 350.0 350.0
U25 400.0 400.0 400.0 400.0 400.0 400.0 400.0 400.0 400.0 400.0 400.0
U26 400.0 400.0 400.0 400.0 400.0 400.0 400.0 400.0 400.0 400.0 400.0 Total
FC 35969 37115 38542 35993 35699 34207 35439 37219 33995 27687 20550 729644
STC 97.54 0.0 0.0 0.0 0.0 0.0 0.0 79.99 0.0 0.0 0.0 1848.83
TC 36066 37115 38542 35993 35699 34207 35439 37299 33995 27687 20550 731492.9