ECONOMIC LOAD DISPATCH USING OPTIMIZATION

TECHNIQUES
Sachin Prakash, Shahbaz Hasnat, Nikhil Kumar Verma, Sachin.

Abstract. Economic Load Dispatch is a method to meet the load demands at minimum cost and losses. In
this paper, ELD problem has been solved for IEEE 13-bus system using two intelligent techniques, namely
Bacterial Foraging Optimization (BFO) algorithm and Particle Swarm Optimization (PSO). The results of two
algorithms have been compared.
1. INTRODUCTION
Economic Load Dispatch (ELD) is an optimization
problem in which the total load demands are divided
among the generating units in a power system in
such a manner that the total power demands are
supplied and at the same time meeting the losses.
ELD problem has been formulated using equality
and inequality constraints. ELD problem can be
solved using various intelligent techniques and
conventional methods. These intelligent techniques
are based on some natural phenomena, such as
genetics or the actions of some living organism such
as bacteria or birds etc.
In this paper, Bacterial Foraging Optimization
(BFO) and Particle Swarm Optimization (PSO)
techniques has been implemented for solving the
ELD problem considering the equality and
inequality constraints. Both the techniques have
been implemented on IEEE 13 bus system and their
results have been compared.
Pmax Maximum power
generation limits of the
generator
Large turbo alternators have a set of valves. When
the power demand increases, these valves are
opened in a sequential manner which leads to losses
called throttling losses. These losses have a tendency
to make the cost-curve non-linear and non-convex.
When the valve is just opened, these losses are very
large and considerable as compared to when the
valve is fully opened after some time. This
phenomenon is known as valve point loading effect.
In this paper, valve-point loading effect has also
been considered. The simulation of a power system
when this effect is considered requires
superimposition of a sinusoidal function along with
the quadratic equation described above. Considering
this effect, we re-write the equation as: -
Min FT= ∑Fi (PGi ) = ∑(ai PGi2+ biPGi+ ci) +
|eisin 𝑓𝑖{PGimin - PGi}| (4)
Where

2. PROBLEM FORMULATION ei ,fi are constants obtained from the valve point
effect of the generating unit i
The ELD problem can be solved mathematically by
minimizing an objective function as given below:

Minimize
FT=∑Fi (PGi ) =∑(ai PGi2+ biPGi+ ci) (1)
Subject to
Equality constraints: -
∑ P = Pload + Plosses (2)
Inequality constraints: -
Pmin < PGi< Pmax (3)
Where

FT Total cost of generation

Fig. 1. Input-Output curve considering valve point
($/hr) loading effect with constants a,b,c,d,e,f.
Fi Fuel-cost of ith Generator
in ($/hr.) 3. Particle Swarm Optimization (PSO)
PGi Real power output of ith
Generator in (MW) Particle swarm optimization is a population-based
ai , b i , ci Fuel-cost coefficients or optimization technique which can be applied for
constants of the generator almost all non-linear complex optimizations in
I nth number of generator power system. It was inspired by the social
Ng Total number of generator behaviour of organisms such as bird flocking and
Pload Total load demand in the fish schooling [20]. It utilizes a population-based
system (MW)
search procedure. In PSO, each particle in the search
Ploss System transmission
space regulates its flying velocity in agreement with
losses (MW)
Pmin Minimum power its own flying velocity and its neighbour’s flying
generation limits of the velocity. The fitness values of all the particles are
generator given by the fitness function. The given function is
then optimized and has velocity, which directs the
flying of particles. This operation is initialized with
a group of solutions and then searches for best
solution by updating particle generations.
Each particle is treated as a point in D dimensional
space, and the ith particle is represented as
Xi = (xi1, xi2……..xid) (5)
The Personal best former position of the ith particle
is recorded and denoted as
Pbesti = (Pbest1, Pbest2,…… Pbestd) (6)
The index of the best among the entire particle in the
population is represented by the symbol Gbest, which
is also called Global best. The velocity (the rate of
the position change) for particle is
Vi = (Vi1,Vi2 ,………Vid) (7)
The velocity and position of each particle can be
calculated using the current velocity and the distance
from Pbestid to Gbestid as shown in
Vidj+1= W*Vjid + C1*rand()*(Pbestid – Xidj) +
C2*rand()*(Gbestid-Xidj) (8)
Inertia weight factor
W= Wmax - ((Wmax-Wmin)*iter)/itermax (9)
Xidj+1 = Xidj +Vidt+1 (10)
The power outputs from each generator are taken as
the particles of the PSO.
The steps and parameters in the PSO algorithm
for the economic load dispatch problem are as
follows:
Step1: In the Initial generations of particles and
future updates of particles are generated in such a
manner that the sum of the outputs of the particles
equals power demand. Hence the demand is always
satisfied, thus only feasible solutions are considered.
Step2: The particle velocities are generated
randomly between maximum and minimum values
of each particle.
Step3: Objective function values are calculated for
each particle and penalties are assigned for those
particles which do not satisfy the demand constraint.
These values are assigned as Pbest and minimum
among these particles is assigned as Gbest.
Step4: New velocities of the particles are evaluated
using (8).
Step5: The position of each particle is modified
using (10).
Step6: New objective function values are calculated
for new positions of the particles. If the new values
are better than previous Pbest and Gbest the new values
are assigned to Pbest and Gbest.
Step7: Repeat steps 2-6 and terminate if the
maximum number of iterations are achieved.
The important parameters in PSO are tabulated in
Table I.
Table I PSO Parameters
Parameters Size
Population size 30
Maximum iterations 200
Nr 10
Nc 5
C 0.001
Ped 0.25
4. Bacterial Foraging Optimization
Algorithm (BFOA)
BFO algorithm inspired by the natural selection
which tends to eliminate the animals with poor
foraging strategies [10, 19] and prefer those who
having successful foraging strategies such as E. coli
and M. xanthus [5]. A bacteria cost is de-rated by its
interaction with other cells. The foraging strategy in
this optimization is governed by four processes
namely Chemotaxis, Swarming, Reproduction,
Elimination and Dispersal [19].
The steps and parameters in the BFO algorithm
for the economic dispatch problem are as follows:
4.1. Chemotaxis
Chemotaxis process is based on movement of
bacteria in search of food. It consists of two
processes called swimming and tumbling. A bacteria
is
I. 'swimming' if it moves in a predefined
direction
II. 'tumbling' if moving in an altogether
different direction.
Let j be the index of chemotactic step, k be the
reproduction step and l be the elimination dispersal
event. Let is the position of ith bacteria at
jth (chemotactic step), kth (reproduction step) and the
lth (elimination dispersal event). The position of the
bacteria in the next step after a tumble is given by
 (11) new random samples are inserted with a low
probability. Elimination and dispersal will helps in
reducing the behaviour of stagnation.

The The important parameters in BFO are tabulated in

chemotaxis behaviour of bacteria that will absorbs Table II.
the nutrients from the environment and move toward
Table II BFO Parameters
or away from specific signals.
Parameters Size
4.2. Swarming
Bacteria exhibits swarm behaviour using Population size 30
locomotion mechanisms (such as flagella) i.e.
healthy bacteria try to attract the other bacteria in Maximum iterations 200
environment so that together they reach the desired
Nr 10
location (solution point) in less time. The effect of
Swarming is to make the bacteria assembled into
Nc 5
groups and move as concentric patterns with high
bacterial population. Depending on the cell-cell Ns 4
interactions, cells may swarm a food source, may
repel or ignore each other. Mathematically C 0.001
swarming behaviour can be written as [4]
Ped 0.25

(12)
4.3. Reproduction
In this step, population members who have had
sufficient nutrients will reproduce and the least
healthy bacteria will not survive. The healthier half
of the population replaces with the other half of
weak bacteria which gets eliminated. This makes the
population of bacteria constant in the evolution
process.
5. CASE STUDY
The two optimization algorithms such as PSO and
BFO are used to solve economic load dispatch with
value point loading effects. The results for 13
generating unit test system [3, 19] on load demand
of 1800MW with non-convex fuel cost functions are
presented.
6. RESULTS AND DISCUSSION
Table III represents results of PSO & BFO
algorithms, implemented on IEEE 13 unit systems
for setting of parameters given in Table I and Table
II:

4.4. Elimination and Dispersal

In the evolution process a sudden unforeseen event
may drastically alter the evolution and may cause the
elimination and/or dispersion to a new environment.
'Elimination-dispersal' where cells are discarded and
 Table III Comparison of Best Results of Each Table IV Results of Test Case (13 Unit System)
Method with Load

Method Mean Max. Cost Min. Cost

Generation PSO BFO Cost ($) ($) ($)
Unit
BFO 18876.392 19324.484 18428.300
P1 538.7739 199.537 PSO 19176.500 19324.000 19011.000

P2 221.8182 181.0475 7. CONCLUSION

P3 82.8304 182.0158 All calculations have been run on Intel(R) Core i5
7th gen, 4 GB RAM, Windows 10 OS and
P4 109.9192 159.729 MATLAB R2017a compiler.
P5 84.0246 159.7561 The application of BFO and PSO algorithm to IEEE
13 bus system with load demand 1800 MW ELD
P6 110.8669 139.216 problems has been successfully demonstrated. The
results shows that BFO has reduced the
P7 111.2817 109.8587
computational time with the optimal fuel compared
to PSO. It is clear that BFO gives minimum fuel cost
P8 109.9197 159.7402
compared to PSO.
P9 109.8419 113.9685 It is clear that BFO gives minimum fuel cost
compared to PSO
P10 40.0004 76.5556
Therefore, the BFO method can
P11 115.1406 114.7973
I.enhance the searching ability
P12 76.2754 111.3806 II.ensure quality of average solutions
III.manages the system constraints.
P13 92.3915 92.4023
REFERENCES
Total power 1803.084 1800.005
output(MW) [1] Kevin M. Passino, “Bacterial Foraging
optimization,” International Journal of
Swarm Intelligence Research, pp. 1-16,
Jan-Mar 2010.
[2] Selva Kumar, and K. Thanushkodi, "A
New Particle Swarm Optimization Solution
to Nonconvex Economic Dispatch
Problems," IEEE Trans. Power Systems,
vol. 22, no. 1, pp. 42-51, Feb. 2007.
[3] K.P Wong and J. Yuryevich, "Evolutionary
Programming Based Algorithm for
Environmentally Constrained Economic
Dispatch", IEEE transaction on Power
Systems”, Vol. 13, No.2, pp 301, May 1998
[4] H. Chowdhury and S. Rahman, "A review
of recent advances in economic dispatch,"
IEEE Trans. Power Syst., vol. 5, no. 4, pp.
1248- 1259, Nov. 1990.
Fig. 2 Cost Function vs. Number of [5] Bijaya Ketan Panigrahi, Yuhui Shi, and
iterations for Problem Meng-Hiot Lim “Handbook of Swarm
Intelligence Concepts, Principles and
Applications,” Springer pp.487-502, 2011.
[6] Jason Brownlee “Clever Algorithms:
Nature-Inspired Programming Recipes,”
Jason Brownlee pp.257-264, 2011.
 [7] Veysel Gazi and Kevin M. Passino “Swarm Transactions on Power Systems, Vol. 10,
Stability and Optimization,” Springer No. 2, pp. 731-738, May 1995.
pp.233-249, 2010. [18] Gaing Z.L. (2003). Particle swarm
[8] J. Wood, and B. F. Wollenberg, “Power optimization to solving the economic
generation operation and control,” John dispatch considering the generator
Willey and Sons, 2nd Ed, pp. 39-43, 1996. constraints. IEEE Trans. Power Syst. 18 (3)
[9] T. Yang, P. C. Yang, and C. L. Huang, 1187–1195.
“Evolutionary programming based [19] R. Vijay, “Intelligent Bacterial Foraging
economic dispatch for units with non- Optimization Technique to Economic Load
smooth fuel cost functions,” IEEE Trans. Dispatch Problem”, IJSCE ISSN: 2231-
Power Syst., vol. 11, no. 1, pp. 112–118, 2307, Volume-2, Issue-2,May 2012.
Feb. 1996 [20] Shubham Tiwari, Ankit Kumar, G.S.
[10] Y. Liu and K. M. Passino, “Biomimicry of Chaurasia, G.S. Sirohi, “Economic Load
social foraging bacteria for distributed Dispatch using Particle Swarm
optimization: Models, principles, and Optimization”, IJAIEM, Volume 2, Issue
emergent behaviors,” Journal Optimal. 4, April 2013.
Theory Appl., Vol. 115, no. 3, pp. 603–
628, Dec. 2002
[11] Sinha Nidul, Chakrabarthi R. and
Chattopadhyay P.K., “Evolutionary
programming techniques for economic
load dispatch”, IEEE Transactions on
Evolutionary computation; 2003, Vol-7,
pp.83- 94.
[12] Nidul Sinha, R. Chakraborti and P.K.
Chattopadhyay, “Improved fast
evolutionary program for economic load
dispatch with non-smooth cost curves”; IE
(I) Journal EL, 2004, Vol. 85.
[13] Mori Hiroyuki and Horiguchi Takuya,
“Genetic algorithm based approach to
economic load dispatching”, IEEE
Transactions on power systems; 1993, Vol.
1, pp. 145-150.
[14] Abido MA, “Multi-objective Evolutionary
algorithms for Electric power dispatch
problem”, IEEE Transactions on
Evolutionary computation; 2006, vol-
10(3), pp315-329.
[15] Y. Yorozu, M. Hirano, K. Oka, and Y.
Tagawa, “Electron spectroscopy studies on
magneto-optical media and plastic
substrate interface,” IEEE Transl. J. Magn.
Japan, vol. 2, pp. 740-741, August 1987
[Digests 9th Annual Conf. Magnetics
Japan, p. 301, 1982].
[16] dos Santos Coelho, Leandro, and Viviana
Cocco Mariani. "An improved harmony
search algorithm for power economic load
dispatch." Energy Conversion and
Management 50.10 (2009): 2522-2526.
[17] Farag Ahmed, Samir Al-Baiyat and T.C.
Cheng, “Economic Load Dispatch Multi-
objective Optimization Procedures using
Linear Programming techniques”, IEEE