APPLICATION OF MOTHFLAME

OPTIMIZATION ALGORITHM FOR SOLVING

DYNAMIC ECONOMIC DISPATCH
INTEGRATED WITH TIME OF USE DEMAND
RESPONSE PROGRAM
Savitha I
Department of Electrical
and Electronics Engineering
Anna University Regional Campus
Coimbatore, 641046
yy
Department of Electrical
and Electronics Engineering
Anna University Regional Campus
Coimbatore, 641046
kk
Department of Electrical
and Electronics Engineering
Anna University Regional Campus
Coimbatore, 641046

Abstract—Smart grid is an electrical grid which uses digital
communication technology to detect and react to local changes
in usage. Since it is a two sided communication, the customers
can get knowledge of their usage from the supply side. Demand
response programs can make the customers to reduce their
electricity consumption or to shift it from peak hours to valley
period and the electricity price can be determined for various
periods optimally. In particular, Time of use (TOU) which is
a price based demand response program has been focused.
Dynamic economic dispatch schedules the generating units in an
efficient manner such that to minimize the fuel cost with inclusive
of constraints such as valve point loading effects, Prohibited
operating zones and ramp rate limits to enhance the network
reliability by focusing on the supply side. By implementing
demand response program in smart grid, the customers are
involved in the process of enhancing network reliability by
curtailing or shifting their consumption by focusing on demand
side. Thus by integrating the DED problem along with TOU the
fuel cost can be effectively minimized and optimal prices during
different periods are determined and their effectiveness is tested
on a ten unit test system. The mentioned problem is a complex
optimization problem and has been solved by implementing a
population based optimization algorithm namely moth flame
optimization (MFO) algorithm.
I. I NTRODUCTION
Demand response is the concept of involving the customers
in the process of improving their benefit and also in enhancing
the network reliability. It is the change in the power consump-
tion of customer to better match the demand for power with
the supply. It can be implemented by the incorporation of
communication systems and sensors such as smart metering
and advanced metering infrastructure (AMI). In smart grid,
which is a two sided communication, can make the customers
to get knowledge of their usage and electricity price and
hence by implementing demand response, the customers can
shift their electricity usage from peak hours to valley period.
Demand response is further divided into two terms which are,
-Price based programs: it is defined as the change in electricity
usage in response to the price of electricity over different
periods such as peak, off-peak and valley.
-Incentive based programs: it is defined as the variation in their
consumption pattern in response to the incentive payments
scheduled to induce lower electricity use at times of peak
demand.
This paper mainly focuses on time of use (TOU) which is a
price based program and by implementing this along with dy-
namic economic dispatch which schedules the generating units
in an efficient manner for the entire dispatch period such that it
minimizes the fuel cost, the electricity prices during different
periods can be determined optimally. By incorporating TOU,
the electricity prices goes high during peak hours and low
during valley hours and hence by this procedure, the customers
are induced to reduce their consumption during peak hours
and shift it to the valley hour [24]. Hybrid algorithm has
been proposed in [9] to provide solution methodology for
dynamic economic emission dispatch with valve point effects
by implementing two hybrid optimization procedures in which
first one combines DE and SQP and second one involves PSO
and SQP. The results are analyzed for 5 and 10 unit test
system [2] proposed a model of demand side management
which involves the consumer side in it by providing smart
energy tariffs and providing incentives to the customers for
changing their consumption pattern and it analyses the types
and characteristics of implementing it.
[29] proposes a new method of solving the integrated
problem of dynamic economic dispatch and demand response
which considers the battery energy storage system, and it is
formulated as a social welfare maximization problem which
is solved by developing a distributed coordination algorithm
by integrating the average consensus protocol with alternating
direction method of multipliers. The developed algorithm
has been analyzed for its efficiency which implies better
maximization and discard the need of other algorithms to
maintain power balance between supply and demand sides.
And the results are verified through case studies on basic
model of Australian power grid. In [10], the integration of
unit commitment with demand response resources which are
the impact of demand response programs, to minimize the
cost inclusive of some constraints and their performance is
investigated on an IEEE 10 unit test system. [11] proposes
the inclusion of demand dispatch with probabilistic wind
power forecasting to use the wind power as operating reserve
requirement and modeled the operation of day-ahead and real
time electricity markets. Also the price responsive demand is
represented as a dispatch able resource to increase litheness
of the system. [30] proposes an optimal power flow solution
which has three objectives such as minimization of fuel
cost considering valve effects and prohibited operating zones,
emission rate and power loss by the use of moth swarm
optimizer and the results are tested on IEEE 30 and 57 bus
system and ensured the better performance of the proposed
system over other methods.
[7] studies the price elasticity in smart grid where the loads are
dispatched by distributed energy management controller units
and this study reveals the difference in price responsive behav-
ior which results from the interaction between the generation
and demand side. On account to this performance, the price
responsive loads are modeled as a set of multi-dimensional
demand price functions and it is helpful in obtaining the
optimal price signal for real time pricing based on demand
response programs. The results are tested on a 6-bus test
system. [8] proposes a new formulation of cost-emission
based unit commitment problem along with demand response
program which is modeled as a mixed-integer programming
problem. Also the economic-driven and environmental-driven
measures of demand response have been analyzed and inde-
pendent system operator has employed strategy success index
to prioritize demand response and results are verified on a 10
unit test system.
[26] proposes a day-ahead multi objective optimization for
BEMS with price based demand response programs to op-
timize the economy and occupants comfort which has three
aspects namely visual comfort, thermal comfort indoor air
quality comfort. YALMIP toolbox in MATLAB has been
used to solve the problem and case study was conducted.
Though Price based demand response programs are efficient,
they have huge impact in economic dispatch schedule and
electricity price. Hence [16] suggests two methods for inves-
tigating the impacts of DR Price elasticity characteristics and
participation level on the convergence of volatile power market
which are, closed loop iterative simulation method and a non-
iterative method and numerical studies demonstrate the impact
on power market convergence by the price based demand
response. [20] presents a solution methodology for issues
related with integration of wind generation in grid. Large
amount of ancillary services are needed in which operating
reserve act as a major part and hence a method of utilizing
pumped hydro storage and demand response has been used as
operating reserve to solve the issue. And using this method
wind uncertainties has been reduced by solving probabilistic
unit commitment problem by means of Lagrangian relaxation
method.
[3] introduces different methods for integrating wind power,
price responsive demand and distributed energy resources
which alters with respect to information exchange necessities,
computational complexity and physical implement ability.
Security constrained economic dispatch is used by this method
and to make this happen SCADA has to be altered to multi-
directional, multi-layered data exchange system. [12] proposes
a new modified teaching learning algorithm to solve the re-
serve constrained dynamic economic dispatch which includes
valve point effects and ramp limits. The proposed method
introduces three types of spinning reserve requirements and a
new constraint-handling to assure them. Since the two phases
such as teaching and learning phases in teaching-learning are
not sufficient for interaction between them in the search space,
this paper proposed an additional phase known as modified
phase which is based on self adaptive learning mechanism to
enhance the performance of the algorithm and the proposed
system is tested on 5, 10, 30, 40, 140 unit test systems for
their efficiency.
Since the performance of evolutionary algorithms are re-
liant on various factor such as control parameters, population
diversity and constraint handling procedure, [21] proposes
a self adaptive differential evolution and real-coded genetic
algorithm for solving the dynamic economic dispatch problem
which makes the problem more feasible. Also the performance
of the algorithm is enhanced by applying constraint-handling
mechanism, dynamic relaxation for equality constraint and
diversity mechanism and their value has been studied. [4] pro-
poses the dynamic economic dispatch problem which includes
valve point effects and the effect of wind power generation
in the system using the quantum genetic algorithm and the
results were tested on real scenarios. Also the results obtained
were compared with other algorithms which have been used
to solve the same problem and the result showed that the
proposed algorithm achieve better result with less computation
time compared other algorithms.
Demand side management implemented with smart grid allows
the consumers to get knowledge of their energy usage and
to reduce it considering the demand period. There are several
techniques and algorithms to solve the problem which handles
only a limited number of loads. [6] overcomes this issue by
using a heuristic based evolutionary algorithm for day-ahead
load shifting technique which is formulated as a minimiza-
tion problem. The results were verified for three customers
namely residential, commercial and industrial and proved that
the proposed model shows high efficiency rather than other
methods. In [22] an optimum sizing of battery energy storage
system incorporated with demand response is proposed using
PSO algorithm. This system results in preventing instability
and system collapse under critical situation. And the proposed
system is compared with battery energy storage system based
simulated annealing included with demand response and the
results proved the efficiency of the proposed system over the
latter one. And finally the costs of BESS are compared for
analysis of economical performance.
[23] presents dynamic economic dispatch considering the un-
certainty caused by wind generation and it has been solved by
stochastic decomposition algorithm and the system is tested on
PJM-5 and RTS-24. The model has an increased advantage of
preventing false generator pre-ramp instructions and evaluates
the reserve requirements. For analyzing the efficiency of the
model, stochastic decomposition is compared with sample
average approximation and a case study for modified IEEE-
118 bus system has been done. [17] presents a multi-objective
dynamic economic emission dispatch which has two objective
functions in which the first one is to minimize the fuel cost
and the second one is to minimize the emission cost and these
two has been incorporated with game theory based demand
response program which determines the optimum incentive
and load restriction for the customers. The proposed model
has been implemented on two test systems.
In [13], dynamic economic dispatch problem has been reduced
to two stage dual problem through Lagrangian relaxation
and the complexity involved in this problem is multiplier
updating strategy and it has been solved in this paper by
using quasi-newton method along with initialization strategy
for the multipliers and the approximation matrix. [18] deals
with the survey of demand response programs implemented
on smart grid. As known, smart grid is meant to have two
sided communication, it makes the customers to reschedule
their energy patterns and have incentives. The survey deals
with four major aspects: programs, issues, approaches and
future extensions of demand response programs. And the
mathematical models and problems are surveyed from various
literature.
[5] proposes the dynamic economic dispatch problem includ-
ing the valve point effects satisfying the ramp rate constraints
for a period of 24 hours. The problem has been solved by
clonal selection based artificial immune system algorithm and
the results are obtained for five and ten unit system and
compared with other methods. [19] investigates the impact of
demand response program on the cost of unit commitment
problem for day ahead scheduling and the model used here is
mixed integer programming unit commitment model. Hence,
the results proved that demand response program can reduce
the cost of electricity and taking this into account, it can be
implemented for future research.
[14] involves the economic dispatch problem in which the
dispatch takes place for day-ahead scheduling, incorporating
hourly demand response model. The problem is formulated as
a mixed-integer quadratically constrained programming prob-
lem with ramping cost as the penalty function and it includes
the constraints such as ramping cost, DR constraints and
quadratic energy balance constraints. Lagrangian relaxation
method has been used to solve the problem and the results
are verified for a 6 bus system and modified IEEE 118 bus
system and proved their efficiency.
In [28], a procedure for investigating the effects of demand
side management on generation side has been developed by
combining the multi-objective dynamic economic and emis-
sion dispatch with DSM, which considers a day ahead based
load shifting DSM approach. The results are obtained for
a six unit test system as two cases, by implementing two
different algorithms such as multi-objective particle swarm
optimization algorithm and non-dominated sorting genetic
algorithm and the results are compared for their effectiveness
and it implies that the combined model gives benefit to both
generation and demand side. [1] presents an algorithm known
as improved chaotic particle swarm optimization algorithm
which is proposed to solve the dynamic economic dispatch
problem to overcome the drawback of premature in that system
when applied with PSO. And the effect of the system is
verified for two test systems with 10 and 30 generators and
their efficiency has been proved.
In [15], a hybrid immune genetic algorithm has been used
to solve the dynamic economic dispatch in which valve point
effects, prohibited operating zones, ramp rate limits and losses
are taken into account. The results are obtained for four test
systems and their effectiveness is illustrated by comparison
with those presented in the literature. In [24], a new method
for optimal pricing in dynamic economic dispatch problem
has been offered by integrating it with time of use demand
response program which not only focuses on customers benefit
but also decreases the fuel cost. Optimal prices for different
periods have been determined and also the generators are
optimally dispatched by implementing Imperialist competitive
algorithm. The system also proved the efficiency of demand
response integrated DED over the dynamic economic dispatch
problem. In [25], a system which integrates the dynamic
economic dispatch problem which deals with supply side and
demand response program which deals with demand side in
an efficient manner which model linear and non-linear loads
for time-based and incentive based demand response programs
is presented. The system includes various constraints and has
been solved by PSO algorithm and the results are obtained
by applying the model on a ten unit system. [27] made an
attempt to optimize PI/PID controller variables of AGC of
power system by using moth flame optimization where four
various power systems are well thought-out in which in the
first case, a two area thermal system has been considered.
And the result has been verified by comparing it with the
same problem optimized by various algorithms and sensitivity
analysis has been made to determine the flexibility of the
system to changing conditions. And the proposed model is
extended for various multi-area multi-source power systems
for simulation studies.
The above described works concentrates on integrating the
dynamic economic dispatch with demand response programs
such that it gives benefit to both supply and demand sides
by providing reduced fuel cost by optimally scheduling the
generator and determining optimal prices during different
periods. The main involvements of this paper are:
-integrating price based demand response program effectively
with dynamic economic dispatch problem.
-providing optimal pricing in TOU by the effective integration
of TOU and DED problem. B. Power balance constraint
-presenting a solution methodology by involving some con-
ng
straints such as valve point loading effects, ramp rate limits X
with population based MFO algorithm. Pi (h) = dm(h) + PLS (h) h = 1, 2...H (4)
-verifying the proposed model by applying it in a ten unit test i=1

system to show the effectiveness. Where dm(h) and PLS (h) are the demand and power loss
of the transmission line at hour h. dm(h) is determined from
II. P ROBLEM F ORMULATION the equation (20) and PLS is obtained by kron’s loss formula
which is given by,
Dynamic economic dispatch is one of the most important
ng ng
optimization problems in power system operation and control X X
which is an extension of conventional economic dispatch PLS (h) = Pi,h Lc (i, j) Pj,h (5)
and takes into consideration of limits on the ramp rate of i=1 i=1

the generating units and it is used to obtain the optimal Where Lc is the power loss coefficient of the network.
dispatch of the generating units for the whole dispatch period
C. Power generation limits
accompanied by minimizing the fuel cost. The fuel cost
function inclusive of the valve point loading effects is given
by Eq. (1) from [24]. Pimin ≤ Pi,h ≤ Pimax i = 1, 2....ng (6)
min max
Where Pi and Pi are the minimum and maximum limit
for power generation at unit i.
2
F Ci (Pi,h ) = cai +cbi Pi,h +cci Pi,h +|vdi sin(vei (pmin
i −Pi,h ))|
(1) D. Generator ramp rate limits
Where Pi,h is the output power of the generating unit i at The increase and decrease of generators power output
hour h and cai , cbi , cci are the fuel cost coefficients for unit is usually termed as ramp up (UR) and ramp down (DR)
i and vdi and vei are the valve point loading effects. respectively, and it should meet the following constraints.
Pi,h − Pi,h−1 ≤ U Ri (7)
To further minimize the fuel cost, demand response has
been integrated along with DED problem in which TIME Pi,h−1 − Pi,h ≤ DRi (8)
OF USE, which is a price based demand response program
has been implemented which determines optimal prices during Where URi and DRi are the ramp up and ramp down limits
different periods and also increases the customers benefit and of the ith unit respectively and expressed in MW/h.
network reliability. Hence the problem integrates the benefit E. Prohibited Operating Zones
for both generation and demand sides. Therefore, the overall
The generating units due to some vibration caused by the
cost function includes the cost for implementing TOU which
steam valve loading have to stop operating in certain zones
is the condensed revenue of the generation companies due to
and they are said to be prohibited operating zones.
the accomplishment of TOU is given by,
min l
Pi,h ≤ Pi,h ≤ P(i,h),1 i = 1, 2...ng (9)
H ng
X X u l
2 P(i,h),q−1 ≤ Pi,h ≤ P(i,h),q h = 1, 2...H
T F (Pi,h ) = {[ {cai + cbi Pi,h + cci Pi,h (10)
h=1 i=1 u max
P(i,h),np ≤ Pi,h ≤ Pi,h q = 2, 3...np (11)
+ |vdi sin(vei (pmin
i − Pi,h ))|}] + CT (h)} (2)
Where np is the number of prohibited operating zones.
Where ng is the number of generating units, Pimin is the
minimum limit for power generation and CT is the cost F. Economic model of price responsive load
associated with implementing TOU and is given by, After implementing TOU, to determine the optimal prices
during different periods, the parameter sg is applied to alter
CT (h) = po (h).dmo (h) − p(h).d(h) (3) the electricity price through different periods as shown in the
following equation,
Where d(h) and dm0 (h) are the demand after implementing
   
TOU and before it during the interval h, p(h) and p0 (h) are the ppeak pa+sg
elasticity price and initial electricity price during the interval p = pof f −peak  =  pa  (12)
h, respectively. pvalley pa−sg
Where p is the price matrix for the entire dispatch period
A. Constraints
which is considered to be H=24h and pa is the initial electricity
The proposed model should satisfy the following equality price, ppeak , poff-peak and pvalley are the new altered electricity
and inequality constraints which is given by, price during peak, off-peak and valley period respectively. By
increasing sg, electricity price during peak period is increased To solve for A in the above equation it is expanded by
while the price during valley period is decreased. During the obtaining Taylor series for A which is given by,
optimization process, the sg will be varied until the optimal
value of sg is reached, which is one of the main of the main ∂A(dm0 (h))
objective of the proposed model. A(d(h)) = A(dm0 (h)) + [dm(h) − dm0 (h)]
∂dm(h)
The limit of the parameter sg is given by,
1 ∂ 2 A(dm0 (h))
+ [dm(h) − dm0 (h)]2 (20)
sg(h)min ≤ sg(h) ≤ sg(h)max (13) 2 ∂dm2 (h)
min max
Where sg(h) is considered to be 0.25 and sg(h) is The above equation can be rewritten as,
considered to be 25 $ per MWh.
To attain optimal consumption by customers, term elasticity A(dm(h)) = A(d0 (h)) + p0 (h)[dm(h) − dm0 (h)]
is considered which is defined as the sensitivity of the de- 1 p0 (h)
mand with respect to electricity price given by the following + [dm(h) − dm0 (h)]2 (21)
2 EL(h, h)dm0 (h)
equation,
( Differentiating the above equation,
0 p0 (h0 ) ∂dm(h) EL(h, h0 ) ≤ 0 if h = h0
EL(h, h ) = ∂A(dm(h)) dm(h) − dm0 (h))
dmo (h) ∂p(h0 ) EL(h, h0 ) ≥ 0 6 h0
if h = = po (h)(1 + ) (22)
∂dm(h) EL(h, h)dm0 (h)
(14)
By combining the equations (17) and (20), the single period
Where EL is the elasticity, dm(h) and dm0 (h) are the demand price responsive model is given by,
after and before implementing TOU at the interval h, and p
and p0 are the elasticity and initial price at the interval h’ p(h) − p0 (h)
dm(h) = dm0 (h)(1 + EL(h, h)) (23)
respectively. The self and cross elasticity values are given in p0 (h)
Table 1.
Intended for the whole dispatch period which is 24 hours in For multi period model,
a day, the self and cross elasticity values are represented by a 24
X p(h0 ) − po (h0 )
24 x 24 matrix given by, dm(h) = dm0 (h)(1+ EL(h, h0 )× ) (24)
p0 (h0 )
h0 =1
 4dm(1)   4p(1) 
dm0 (1) p0 (1) h0 6=h
   
     
 4dm(2) 
EL(1, 1) · · · EL(1, 24)
 4p(2)  At last the entire model inclusive of both single and multi-
dm0 (2)
   p (2) 
0
   ..    period model is given by,


=
 . ×
 


4dm(3)  4p(3) 24
 
EL(24, 1) · · · EL(24, 24)
 X p(h0 ) − po (h0 )
dm0 (3)
EL(h, h0 )×
 p0 (3)
dm(h) = dm0 (h)(1+ ) (25)
  
···  ··· p0 (h0 )
   
h0 =1
  
4dm(24) 4p(24)
dm0 (24) p0 (24)
(15) By implementing this model, the demand can be shifted from
The net-profit obtained by the customer is given by the differ- peak period to valley or off-peak periods.
ence between the customers profits due to their consumption
III. SOLUTION METHODOLOGY
of electricity and producing their commodities which is given
by the following equation, Moth flame optimization is a recent nature-inspired popu-
lation based optimization technique which is mainly based on
N T (h) = A(dm(h)) − dm(h)p(h) (16) the special navigation characteristics called transverse orien-
tation of creatures known as moths. Moths can travel in night
 Wnp 
φ=
ρnp
× 100% (17) time using the moon as a source of light by maintaining a
Wnp
ρnp +Ww
ρw fixed angle with the source and travels in a straight line, which
Where NT is the net-profit and A is the return obtained is applicable only for far away sources. However, the moths
by the customers due to their consumption pattern and to when distracted by the artificial lights made by human, which
maximize their profit, the derivative of the above equation is nearer to them, will try to maintain the same angle as with
should be zero which is given by, moon and results in a deadly spiral path. The moths by this
spiral path will tend to converge towards the artificial light
∂N T (h) ∂A(dm(h))
= − p(h) = 0 (18) and this behavior is mathematically modeled for developing
∂dm(h) ∂dm(h) the optimization technique.
Therefore the equation can be written as, By modeling this behavior, moth flame optimization algorithm
∂A(dm(h)) is proposed in which each candidate solutions are assumed as
= p(h) (19) moths and the problem variables as positions of moths. Hence,
∂dm(h)
the moths can travel in hyper dimensional space by changing moths is updated using a spiral equation in which each moth
their position vectors. Here moth and flames, both are solutions updates its position with respect to a flame. Since the algorithm
where moths are the search agents that travel around the search is encouraged by spiral movement of moths, therefore the
space and flames are the best position obtained by them. Thus, position of moths is updated by a spiral function which is
every moth searches in the region of the flame and updates it given by,
when it identifies a better solution and hence by this method, M Mi = S(M Mi , F Lj ) (32)
a moth by no means loses its best solution. The moths are
initialized as a matrix which is shown below,
  Where S represents the spiral function, represents the i−h
mm1,1 mm1,2 ··· mm1,d moth and represents the j−th flame. The spiral function worn
 mm2,1 mm2,2 ··· mm2,d  here is logarithmic spiral and also any type of spiral can be
MM =  . ..  (26)
 
. . used limited to the conditions such as,
 .. .. .. . 
mmn,1 mmn,2 ··· mmn,d • Spiral’s initial point must start from moth and end to-
wards the flame.
Where n is the number of moths and d is the dimension of • The fluctuation range of spiral is supposed to not exceed
the variables. the boundary conditions.
For each moth, corresponding fitness value is evaluated and In view of these conditions, a logarithmic spiral can be defined
stored in a matrix as shown below, as,
 
F M1 S(M Mi , F Lj ) = DSi × ebv × cos(2πv) + F Lj (33)
 F M2 
FM =  .  (27) DSi = |F Lj − M Mi |
 
(34)
 .. 
F Mn
Where DSi indicates the distance between the i−th moth
Where n represents the population of moths. and j−th flame, b is a constant for logarithmic spiral ant v
Flames are the another important component of this algorithm represents how close the next position of moth to the flame
which is the best position obtained by moths and it is also which is a random number in [-1,1] in which -1 represents
represented by a matrix similar to moths as shown below, the closest position of moth to the flame and 1 represents the
  farthest position to the flame. Hence by this, the following
f l1,1 f l1,2 ··· f l1,d interpretations are prepared,
 f l2,1 f l2,2 ··· f l2,d 
FL =  .
 
(28) • Moths can converge to any point nearer to flame by
. .. .. 
 .. .. . .  varying v.
f ln,1 f ln,2 ··· f ln,d • By decreasing v, the distance between moth and flame
decreases.
From above, it is seen that moth and flames are both equal • The rate of recurrence of position updating on either sides
arrays. The fitness value of flames is also stored in a matrix of the flame is improved.
shown by, By equation (27), the next position of moth is determined with
  respect to a flame and likewise, the spiral path for moths is
F F1
 F F2  simulated. By this, two important phases such as exploitation

 · 
 and exploration are assured. By updating the position through
FF =    (29) spiral equation, initially exploitation is ensured. To enhance
 · 

 ·  the chance of determining better solution, often the best
solution obtained so far is taken into account. Therefore the
F Fn
matrix FL in (23) often includes up to date best solution. To
Where n represents the population of moths. There are other further accentuate exploitation, the variable v in the equation
two arrays which contain the upper and lower boundaries of (27) is assumed as a random number in [c,1] in which c is
the variables which verify the boundary limits for the control linearly decreased from -1 to -2 through the iteration, where
variables and it is given by, it is denoted as a convergence constant. By this method, the
exploitation tendency of moths increases. Since the moths need
U B = [U B1 , U B2 , .......U Bn−1 , U Bn ] (30) to move towards the flame, there will be a lot of chance
for the algorithm to get trapped into the local optimum. To
LB = [LB1 , LB2 , .......LBn−1 , LBn ] (31)
avoid this, every moth is updated by the spiral equation with
respect to one flame. During every iteration, after updating
Where UB and LB are the upper and lower boundaries for the the flames, they are sorted based on their fitness value. And
control variables. the moths are updated in the sequence that, first moth updates
As the moths travel around the search space, the position of with respect to best flame likewise the last moth updates with
respect to worst flame. Hence the moths do not converge to
single flame and thus results in higher exploration and prevent
chances of local optimum stagnation. However this method
can corrupt exploitation and to solve this, a mechanism has
been introduced for updating the number of flames, which is
the number of flames are decreased over the iteration by using
the formula given below,
MF − 1
F lame number = round(M F − CI × ) (35)
MI

Where CI is the current iteration, MF is the maximum number

of flames and MI represents the maximum iteration. Hence, by
this method moths update their position only based on the best
flame during the last stage of iteration and steady decrease of
flames balances exploration and exploitation.

PSEUDOCODE

1) Import the input data such as population, maximum

iteration, upper and lower boundaries of the control
variables.
2) Initialize the moth population and check for boundaries.
3) While iter<maximum iteration+1
4) Update flame number and v
5) For all moths
6) Calculate the fitness value
7) end for
8) If iter=1
9) Sort the first population of moths
10) Update the flames
11) else
12) Sort the previous and current population of moths
13) Update the flames
14) end if Fig. 1. Moth Flame Algorithm
15) Update the position best flame obtained so far
16) For all moths
17) If i <= flame number are checked for the given upper and lower boundaries and
18) Evaluate DS and update the position of moth with influence of ramp limits on the next hour are verified by
respect to its corresponding flame altering the upper and lower boundaries with respect to ramp
19) end if rate and now the moth positions are verified for the altered
20) If i>flame number upper and lower boundaries and the loss is calculated by using
21) Evaluate DS and update the position of moth with kron’s loss formula. And the violation has been determined
respect to one flame by using equation (4) and the fuel cost for each moth are
22) end if calculated by (1) and the fitness value is evaluated when the
23) end for determined fuel cost is added to the violation and to update the
24) Iter=iter+1 flames, the fitness values of moths are sorted with their cor-
25) end while responding positions and the sorted population is assumed as
best flames and sorted fitness is assumed as best flame fitness
IV. IMPLEMENTATION in case of first iteration or else before sorting the population
In this part, a process for solving the DEDTOU prob- and fitness value, previous population and previous fitness is
lem by (MFO) moth flame optimization algorithm has been also considered along with the current population and fitness
demonstrated. By implementing this algorithm, the population and the process of updating best flames is carried out. And
parameters are output power of generating units and they the current moth position and moth fitness are considered as
are initialized as moth position. And the flame numbers are previous population and previous fitness for the next iteration.
updated while initiating the iteration and the moth positions And the distance between the moth and flames are calculated
and the moth positions are updated by the spiral equation
and the process continues up to the maximum iteration and
the candidates which have reduced fitness value i.e. fuel cost,
TABLE 1:SELF AND CROSS ELASTICITY VALUES
will be selected as the optimum value. And finally, the power
balance constraints and ramp rate constraints are checked. The
above mentioned process is for base case which implements Peak Off-Peak Valley
only the dynamic economic dispatch without implementing Peak -0.10 0.016 0.012
TOU. The next case involves the implementation of TOU in Off-Peak 0.016 -0.10 0.01
which the electricity prices are varied by applying a parameter Valley 0.012 0.01 -0.10
sg, by which electricity price is increased during peak period The generation cost for all the cases are obtained and the
and decreased during valley period and made constant during overall cost of the proposed system after implementing TOU
off-peak period. Hence, the sg value is linearly increased from has also been provided in table 2. Also the optimal sigma for
0.25 to 25 and the process is continued until the optimal all the three cases by which the minimum cost obtained is
amount of sg value i.e. the sg value which gives the best fitness also presented in table 2.
is obtained. Here, TOU is implemented only for 20% of load
and only by considering this load, the cost for implementing
TOU has been determined by (3) and by the 20% of load, new TABLE 2:RESULTS OF IMPLEMENTING DED IN TOU
demand has been calculated and by using this demand, the Case 1 Case 2 Case 3 Case 4
procedure for dynamic economic dispatch which is mentioned Generation 1008822 997527 997000 989254
above as base case has been carried out. It is found out that Cost
the fitness value obtained by this case is more economical than Optimal - 4.25 5.75 3.25
previous case. Likewise, two other cases have been solved by Sigma
considering the price elasticity matrix to be 1, 0.5, and 2 times CT - 7773 863.432 17346
the matrix. Overall Cost 1008822 1005300 997860 1006600
The above mentioned procedure of DEDTOU was carried out Load Factor 81.4145 83.6770 82.9245 84.9534
by applying Moth Flame Optimization algorithm and it is Peak to Val- 42.11 37.9705 39.3457 35.6379
repeated by slightly modifying the algorithm by changing the ley
method of varying the variable c where in MFO the variable Peak - 3.1076 2.5613 4.4815
was decreased linearly and here it is deceased randomly and compensate
the obtained results were provided.
From the above table, it is clear that the overall cost for all
V. R ESULTS AND D ISCUSSION the cases implementing TOU is reduced compared with the
The effectiveness of the proposed system is tested by apply- first one. Though the integration of demand response imposes
ing it on a ten unit test system. And the characteristics of the a supplementary cost, however the system manages to reduce
test systems are obtained from [24]. The initial electricity price the cost than base case. As it is seen from the table, case 3
was chosen to be 25 $ /MWh and the price elasticity matrix which has the lowest PEM (price elasticity matrix) has the
was given in table 1. The load curve is categorized as peak maximum sigma value and it imposes the lower cost and the
(11-16 hours and 20-24 hours), off-peak (8-10 hours and 17-19 one which has the higher PEM (case 4, 2 times of the matrix
hours) and valley (1-7 hours). The proposed system has been in table 1) has the least sigma value.
implemented for different cases by considering the dynamic
6
economic dispatch problem as case 1 and the remaining cases x 10
are considered by the implementation of TOU by varying the 1.2
case 3
price elasticity matrix equal to 1, 0.5 and 2 times of the matrix case 2
1.15
Overall cost

provided in table 1 as case 2, 3 and 4 respectively. case 4

To calculate the performance of demand response integration
in enhancing the load curve characteristics, various factors 1.1
such as Load factor, Peak to valley, Peak compensate are
defined as 1.05
PH
dm(h)
1
DF = 100( h=1 max ) (36)
H × dm (h) 0 5 10 15 20 25
Sigma
dmmax (h) − dmmin (h)
P Y = 100( ) (37) Fig. 2. Cost variation against sigma for three TOU cases
dmmax (h)
dmmax
0 (h) − dmmin (h) The variation of the overall cost with respect to sigma values
P T = 100( ) (38) for three cases implemented with TOU are shown in figure 1.
dmmax
0 (h)
From this the optimal sigma values for three cases has been 6
x 10
illustrated. Also the load curve for all the cases has been shown 1.05
in figure 2. From the curve it is ensured that after integrating Total Cost
1.04

Total cost
2000
1.03
1800
Demand(MW)

1.02
1600
case1
1.01
1400 0 100 200 300 400 500 600 700
case2 Iteration
1200 case3
case4 Fig. 5. Convergence curve for case 1
1000
0 5 10 15 20 25
Time (hour) the algorithm are given below.
Fig. 3. Demand curve before and after integration of TOU
TABLE 5:RESULTS OF IMPLEMENTING DED IN TOU
TOU with dynamic economic dispatch problem, the demand BY MODIFIED MFO
gets reduced during peak hours and it gets shifted to the valley
From the above table, it is clear that the overall cost for
period. And the constraints mentioned for the DED problem
all the cases implementing TOU by applying modified MFO
such as ramp rate and prohibited operating zones are satisfied
is reduced compared with the first one. As it is seen from
after implementation of TOU. Also the variation of elasticity
the table, case 3 which has the lowest PEM (price elasticity
price against time has been illustrated in figure 3.
matrix) has the maximum sigma value and it imposes the lower
cost and the one which has the higher PEM (case 4, 2 times
35 of the matrix in table 1) has the least sigma value.

6
Elasticity Price

30 x 10
1.3
Case 2
25 Case 3
Overall cost

case2 1.2 Case 4

20
15
0 5 10
Time(hours)
Fig. 4. Elasticity price curve
Hence it is observed that the elasticity price for customers with
large PEM value will have the least amount of sigma as in case
4 (2 times of the matrix in table 1) and the customers with
minimum PEM value have the maximum amount of sigma as
seen in case 3. The optimal sigma obtained for the cases 2-
4 are 4.25, 5.75 and 3.25 respectively.The convergence graph
obtained for the base case without implementation of demand
response is shown in the figure 4. And the optimal dispatch
obtained by case 1 and case 3 are shown in table 3 and 4.
TABLE 3:OPTIMAL DISPATCH OBTAINED FOR CASE 1
TABLE 4:OPTIMAL DISPATCH OBTAINED FOR CASE 3
The results obtained for the proposed dynamic economic
dispatch problem integrated with Time of use by modifying
case3
case4
1.1
15 20 25
1
0 5 10 15 20 25
Sigma
Fig. 6. Cost variation against for three TOU cases obtained by modified MFO
The variation of the overall cost with respect to sigma values
for three cases implemented with TOU obtained by applying
modified MFO are shown in figure 5. From this the optimal
sigma values for three cases has been illustrated. Also the load
curve for all the cases has been shown in figure 6.
From the curve it is ensured that after applying modified
MFO for integration of TOU with dynamic economic dispatch
problem, the demand gets reduced during peak hours and it
gets shifted to the valley period. And the constraints mentioned
for the DED problem such as ramp rate and prohibited operat-
ing zones are satisfied after implementation of TOU. Also the
variation of elasticity price against time has been illustrated
in figure 7. Hence it is observed that the elasticity price for
 TABLE I
OPTIMAL DISPATCH OBTAINED FOR CASE 1

Hour Load P1 P2 P3 P4 P5 P6 P7 P8 P9 P10

1 1300 305.826 329.251 275.925 120.200 150.493 57 20 47 20 10
2 1250 379.863 291.571 271.067 72.316 115.605 57 20 47 20 10
3 1175 300.153 346.954 271.459 60 73 57 20 47 20 10
4 1100 308.648 303.358 227.611 60 73 57 20 47 20 10
5 1150 301.784 337.937 232.215 80.093 73 57 20 47 20 10
6 1250 369.073 400.500 229.332 60 73 57 20 47 20 10
7 1350 354.455 398.664 302.798 60 120.850 57 20 47 20 10
8 1475 410.730 399.087 310.704 78.240 166.216 61.429 20 47 20 10
9 1525 397.461 446.989 300.136 119.277 116.216 99.350 20 47 20 10
10 1600 381.373 451.264 246.071 168.755 162.645 140.127 27.562 47 20 10
11 1675 386.704 393.560 292.037 200.285 204.534 123.662 55.806 47 20 10
12 1750 458.575 393.560 279.101 208.594 233.176 104.642 60.218 47 20 10
13 1875 447.624 410.076 291.043 257.242 229.147 146.230 89.568 47 20 10
14 1900 442.547 435.623 318.263 265.978 223.744 106.766 76.675 75.863 20 10
15 1800 418.060 432.902 315.805 236.191 183.317 131.289 53.255 67.034 20 10
16 1725 447.155 388.146 283.495 241.099 205.968 82.449 62.679 47 20 10
17 1575 367.155 334.735 272.449 247.228 190.083 80.707 56.664 47 20 10
18 1450 348.105 373.903 238.915 232.923 140.083 57 26.664 47 20 10
19 1550 398.933 374.830 297.415 185.436 188.104 59.716 20 47 20 10
20 1625 433.224 388.675 293.332 189.789 175.667 103.892 20 47 20 10
21 1775 406.923 407.017 302.149 239.243 220.950 147.631 37.289 47 20 10
22 1850 446.085 427.313 317.363 242.897 217.212 128.151 65.842 49.212 20 10
23 1750 390.401 435.884 273.514 242.373 234.999 80.300 79.692 47 20 10
24 1650 454.141 37.034 261.316 193.436 223.126 57 72.187 47 20 10

2000 40
Demand (MW)

Elasticity Price

1800
30
1600
Case1
1400 Case2 20 Case2
Case4 Case3
1200
Case3 Case4
1000 10
0 5 10 15 20 25 0 5 10 15 20 25
Time (Hour) Time (Hours)
Fig. 7. Demand curve before and after integration of TOU obtained by Fig. 8. Elasticity price curve obtained for modified MFO
modified MFO
6
x 10
1.05
customers with large PEM value will have the least amount
of sigma as in case 4 (2 times of the matrix in table 1) and Total cost
Total cost

the customers with minimum PEM value have the maximum 1.04
amount of sigma as seen in case 3. The optimal sigma obtained
for the cases 2-4 are 5, 11.25 and 1.25 respectively.
The convergence graph obtained for the base case without 1.03
implementation of demand response is shown in the figure 8.
And the optimal dispatch obtained by case 1 and case 3 are
shown in table 6 and 7. 1.02
0 100 200 300 400 500 600 700
TABLE 6:OPTIMAL DISPATCH OBTAINED FOR CASE 1 Iteration
BY MODIFIED MFO
Fig. 9. Convergence curve for case 1 obtained by modified MFO
TABLE 7:OPTIMAL DISPATCH OBTAINED FOR CASE 3
BY MODIFIED MFO
 The convergence graph obtained for the base case is shown
in figure 6.
6 [4] Lee, Jia-Chu, Whei-Min Lin, Gwo-Ching Liao, and Ta-Peng Tsao.
x 10
1.05
Total cost
Total cost
1.04
1.03
1.02
0 100 200 300 400 500 600
Iteration
Fig. 10. Convergence curve for case 1 by modified MFO
VI. C ONCLUSION
Reduction of cost and enhancement of network reliability
are the two important causes for the implementation of demand
response program in dynamic economic dispatch problem.
Hence it is ensured that the integration of Time of Use demand
response program (TOU) in DED problem reduces the genera-
tion cost than the usual DED problem and also provide benefit
to the customers by informing about their usage and induces
them to transfer their demand from peak hours to valley hours.
Though demand response induces an additional cost which is
the cost involved in implementing demand response, however
the overall cost of the system gets reduced. It is made possible
by selecting the optimal prices through different periods.
The proposed system involves the solution method namely
MFO algorithm was presented through some descriptions.
The constraints involved in dynamic economic dispatch such
as ramp rate limitations, prohibited operating zones, power
balance constraints are verified for the effectiveness of the
proposed system and they ensure the system accuracy. Thus
the results were obtained and verified for customers with three
various patterns and it ensures that the customers with larger
PEM (price elasticity matrix) value has the minimum amount
of sigma and customers with smaller PEM has the larger
amount of sigma as shown in table 2. Hence the proposed
system ensures the minimization of fuel cost and determination
of optimal prices through different periods simultaneously.
Therefore it was made sure that the integration of demand
response with DED can reduce generation as well as con-
sumption cost thus resulting in enhancing network reliability.
R EFERENCES
[1] Wang, Ying, Jianzhong Zhou, Hui Qin, and Youlin Lu. ”Improved
chaotic particle swarm optimization algorithm for dynamic economic
dispatch problem with valve-point effects.” Energy Conversion and
Management 51, no. 12 (2010): 2893-2900.
[2] Palensky, Peter, and Dietmar Dietrich. ”Demand side management:
Demand response, intelligent energy systems, and smart loads.” IEEE
transactions on industrial informatics7, no. 3 (2011): 381-388.
[3] Ilic, Marija D., Le Xie, and Jhi-Young Joo. ”Efficient coordination of
wind power and price-responsive demand—Part I: Theoretical founda-
tions.” IEEE Transactions on Power Systems 26, no. 4 (2011): 1875-
1884.
”Quantum genetic algorithm for dynamic economic dispatch with valve-
point effects and including wind power sytem.” International Journal of
Electrical Power & Energy Systems 33, no. 2 (2011): 189-197.
[5] Hemamalini, S., and Sishaj P. Simon. ”Dynamic economic dispatch
using artificial immune system for units with valve-point effect.” In-
ternational Journal of Electrical Power & Energy Systems 33, no. 4
(2011): 868-874.
[6] Logenthiran, Thillainathan, Dipti Srinivasan, and Tan Zong Shun. ”De-
mand side management in smart grid using heuristic optimization.” IEEE
transactions on smart grid 3, no. 3 (2012): 1244-1252.
[7] Yu, Rongshan, Wenxian Yang, and Susanto Rahardja. ”A statistical
demand-price model with its application in optimal real-time price.”
700 IEEE Transactions on Smart Grid 3, no. 4 (2012): 1734-1742.
[8] Abdollahi, Amir, Mohsen Parsa Moghaddam, Masoud Rashidinejad,
and Mohammad Kazem Sheikh-El-Eslami. ”Investigation of economic
and environmental-driven demand response measures incorporating UC.”
IEEE transactions on smart grid 3, no. 1 (2012): 12-25.
[9] Elaiw, A. M., X. Xia, and A. M. Shehata. ”Hybrid DE-SQP and hybrid
PSO-SQP methods for solving dynamic economic emission dispatch
problem with valve-point effects.” Electric Power Systems Research 103
(2013): 192-200.
[10] Arasteh, H. R., M. Parsa Moghaddam, M. K. Sheikh-El-Eslami, and
A. Abdollahi. ”Integrating commercial demand response resources with
unit commitment.” International Journal of Electrical Power & Energy
Systems 51 (2013): 153-161.
[11] Botterud, Audun, Zhi Zhou, Jianhui Wang, Jean Sumaili, Hrvoje Keko,
Joana Mendes, Ricardo J. Bessa, and Vladimiro Miranda. ”Demand
dispatch and probabilistic wind power forecasting in unit commitment
and economic dispatch: A case study of Illinois.” IEEE Transactions on
Sustainable Energy 4, no. 1 (2013): 250-261.
[12] Niknam, Taher, Rasoul Azizipanah-Abarghooee, and Jamshid Aghaei.
”A new modified teaching-learning algorithm for reserve constrained
dynamic economic dispatch.” IEEE Transactions on power systems 28,
no. 2 (2013): 749-763.
[13] Li, Zhigang, Wenchuan Wu, Boming Zhang, Hongbin Sun, and Qinglai
Guo. ”Dynamic economic dispatch using Lagrangian relaxation with
multiplier updates based on a quasi-Newton method.” IEEE Transactions
on Power Systems 28, no. 4 (2013): 4516-4527.
[14] Wu, Hongyu, Mohammad Shahidehpour, and Mohammad E. Khodayar.
”Hourly demand response in day-ahead scheduling considering gener-
ating unit ramping cost.” IEEE Transactions on Power Systems 28, no.
3 (2013): 2446-2454.
[15] Mohammadi-Ivatloo, Behnam, Abbas Rabiee, and Alireza Soroudi.
”Nonconvex dynamic economic power dispatch problems solution using
hybrid immune-genetic algorithm.” IEEE Systems Journal 7, no. 4
(2013): 777-785.
[16] Zhao, Zhechong, Lei Wu, and Guohui Song. ”Convergence of volatile
power markets with price-based demand response.” IEEE transactions
on Power Systems 29, no. 5 (2014): 2107-2118.
[17] Nwulu, Nnamdi I., and Xiaohua Xia. ”Multi-objective dynamic eco-
nomic emission dispatch of electric power generation integrated with
game theory based demand response programs.” Energy Conversion and
Management 89 (2015): 963-974.
[18] Deng, Ruilong, Zaiyue Yang, Mo-Yuen Chow, and Jiming Chen. ”A
survey on demand response in smart grids: Mathematical models and
approaches.” IEEE Transactions on Industrial Informatics 11, no. 3
(2015): 570-582.
[19] Magnago, F. H., J. Alemany, and J. Lin. ”Impact of demand response
resources on unit commitment and dispatch in a day-ahead electricity
market.” International Journal of Electrical Power & Energy Systems 68
(2015): 142-149.
[20] Kiran, B. Durga Hari, and M. Sailaja Kumari. ”Demand response and
pumped hydro storage scheduling for balancing wind power uncertain-
ties: A probabilistic unit commitment approach.” International Journal
of Electrical Power & Energy Systems 81 (2016): 114-122.
[21] Zaman, M. F., Saber M. Elsayed, Tapabrata Ray, and Ruhul A. Sarker.
”Evolutionary algorithms for dynamic economic dispatch problems.”
IEEE Transactions on Power Systems 31, no. 2 (2016): 1486-1495.
[22] Kerdphol, Thongchart, Yaser Qudaih, and Yasunori Mitani. ”Optimum
battery energy storage system using PSO considering dynamic demand
response for microgrids.” International Journal of Electrical Power &
Energy Systems 83 (2016): 58-66.
[23] Liu, Yang, and Nirmal-Kumar C. Nair. ”A two-stage stochastic dynamic
economic dispatch model considering wind uncertainty.” IEEE Transac-
tions on Sustainable Energy 7, no. 2 (2016): 819-829.
[24] Dehnavi, Ehsan, and Hamdi Abdi. ”Optimal pricing in time of use
demand response by integrating with dynamic economic dispatch prob-
lem.” Energy 109 (2016): 1086-1094.
[25] Abdi, Hamdi, Ehsan Dehnavi, and Farid Mohammadi. ”Dynamic eco-
nomic dispatch problem integrated with demand response (DEDDR)
considering non-linear responsive load models.” IEEE Transactions on
Smart Grid 7, no. 6 (2016): 2586-2595.
[26] Wang, Fei, Lidong Zhou, Hui Ren, Xiaoli Liu, Saber Talari, Miadreza
Shafie-khah, and João PS Catalão. ”Multi-objective optimization model
of source–load–storage synergetic dispatch for a building energy man-
agement system based on tou price demand response.” IEEE Transac-
tions on Industry Applications 54, no. 2 (2018): 1017-1028.
[27] Barisal, Ajit Kumar, and Deepak Kumar Lal. ”Application of moth flame
optimization algorithm for AGC of multi-area interconnected power
systems.” International Journal of Energy Optimization and Engineering
(IJEOE) 7, no. 1 (2018): 22-49.
[28] .Lokeshgupta, B., and S. Sivasubramani. ”Multi-objective dynamic eco-
nomic and emission dispatch with demand side management.” Interna-
tional Journal of Electrical Power & Energy Systems 97 (2018): 334-
343.
[29] Qin, Jiahu, Yanni Wan, Xinghuo Yu, Fangyuan Li, and Chaojie Li.
”Consensus-based distributed coordination between economic dispatch
and demand response.” IEEE Transactions on Smart Grid (2018).
[30] Kotb, Mohamed F., and Attia A. El-Fergany. ”Optimal Power Flow
Solution Using Moth Swarm Optimizer Considering Generating Units
Prohibited Zones and Valve Ripples.” Journal of Electrical Engineering
& Technology (2019): 1-14.