Professional Documents
Culture Documents
net/publication/314785727
CITATIONS READS
29 1,023
3 authors, including:
Some of the authors of this publication are also working on these related projects:
Non-convex economic load dispatch problems using novel bat algorithm View project
All content following this page was uploaded by Hardiansyah Hardiansyah on 21 April 2017.
Abstract— Economic load dispatch (ELD) problem is a of dimensionality” or local optimality. In order to
common task in the operational planning of a power overcome this problem, several alternative methods
system, which requires to be optimized. This paper have been developed such as genetic algorithm [4],
presents an effective and reliable particle swarm evolutionary programming [5, 6], tabu search [7],
optimization (PSO) technique for the economic load neural network [8], and particle swarm optimization [9-
dispatch problem. The results have been demonstrated 11].
for ELD of standard 3-generator and 6-generator
Particle swarm optimization (PSO) is suggested by
systems with and without consideration of transmission
Kennedy and Eberhart based on the analogy of swarm
losses. The final results obtained using PSO are
of birds and school of fish [12]. PSO mimics the
compared with conventional quadratic programming
behavior of individuals in a swarm to maximize the
and found to be encouraging.
survival of the species. In PSO, each individual makes
his decision using his own experience together with
other individuals‟ experiences. The algorithm, which is
Index Terms— Economic Load Dispatch, Particle
based on a metaphor of social interaction, searches a
Swarm Optimization, Quadratic Programming
space by adjusting the trajectories of moving points in a
multidimensional space. The individual particles are
drawn stochastically toward the position of present
I. Introduction velocity of each individual, their own previous best
performance, and the best previous performance of their
The economic load dispatch (ELD) of power neighbors. The main advantages of the PSO algorithm
generating units has always occupied an important are summarized as: simple concept, easy
position in the electric power industry. ELD is a implementation, robustness to control parameters, and
computational process where the total required computational efficiency when compared with
generation is distributed among the generation units in mathematical algorithms and other heuristic
operation, by minimizing the selected cost criterion, optimization techniques [12, 13]. PSO can be easily
subject to load and operational constraints. For any applied to nonlinear and non-continuous optimization
specified load condition, ELD determines the power problem.
output of each plant (and each generating unit within
the plant) which will minimize the overall cost of fuel In this paper, a PSO technique for solving the ELD
needed to serve the system load [1]. ELD is used in problem in power system is proposed. The feasibility of
real-time energy management power system control by the proposed method was demonstrated for a three units
most programs to allocate the total generation among and six units system and the results were compared with
the available units. ELD focuses upon coordinating the quadratic programming method [14]. The results
production cost at all power plants operating on the indicate the applicability of the proposed method to the
system. practical ELD problem.
In the traditional ELD problem, the cost function for The rest of this paper is organized as follow. Section
each generator has been approximately represented by a 2 presents the ELD formulation. Section 3 presents
single quadratic function and is solved using quadratic programming method. Section 4 proposes
mathematical programming based optimization PSO technique to solve ELD problem. Results and
techniques such as lambda iteration method, gradient- discussions are given in section 5, and section 6 gives
based method, etc [2]. These methods require some conclusions.
incremental fuel cost curves which are piecewise linear
and monotonically increasing to find the global optimal
solution.
II. Economic Load Dispatch Formulation
Dynamic programming (DP) method [3] is one of the
The objective of an ELD problem is to find the
approaches to solve the non-linear and discontinuous
optimal combination of power generations that
ELD problem, but it suffers from the problem of “curse
Copyright © 2012 MECS I.J. Intelligent Systems and Applications, 2012, 12, 12-18
Solving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique 13
minimizes the total generation cost while satisfying an Subject to Ax b and x 0 (6)
equality constraint and inequality constraints. The fuel
cost curve for any unit is assumed to be approximated where c is an n-dimensional row vector describing the
by segments of quadratic functions of the active power coefficients of the linear terms in the objective function,
output of the generator. For a given power system and Q is an (n × n) symmetric matrix describing the
network, the problem may be described as optimization coefficients of the quadratic terms. If a constant term
(minimization) of total fuel cost as defined by (1) under exists it is dropped from the model. As in linear
a set of operating constraints. programming, the decision variables are denoted by the
n-dimensional column vector x, and the constraints are
n n
FT F ( Pi ) ai Pi 2 bi Pi ci
defined by an (m× n) A matrix and an m-dimensional
(1) column vector b of right-hand-side coefficients. We
i 1 i 1 assume that a feasible solution exists and that the
constraint region is bounded. When the objective
where FT is total fuel cost of generation in the system
function f(x) is strictly convex for all feasible points the
($/hr), ai, bi, and ci are the cost coefficient of the i th problem has a unique local minimum which is also the
generator, Pi is the power generated by the i th unit and global minimum. A sufficient condition to guarantee
n is the number of generators. strictly convexity is for Q to be positive definite.
The cost is minimized subjected to the following If there are only equality constraints, then the QP can
generator capacities and active power balance be solved by a linear system. Otherwise, a variety of
constraints. methods for solving the QP are commonly used, namely;
interior point, active set, conjugate gradient, extensions
Pi ,min Pi Pi ,max for i 1,2,, n (2)
of the simplex algorithm etc. The direction search
algorithm is minor variation of quadratic programming
where Pi, min and Pi, max are the minimum and maximum
for discontinuous search space. For every demand the
power output of the i th unit.
following search mechanism is followed between lower
n and upper limits of those particular plants. For meeting
PD Pi PLoss (3) any demand the algorithm is explained in the following
i 1 steps:
where PD is the total power demand and PLoss is total 1) Assume all the plants are operating at lowest
transmission loss. incremental cost limits.
The transmission loss PLoss can be calculated by using 2) Substitute Pi Li (U i Li ) X i ,
B matrix technique and is defined by (4) as,
where 0 X i 1 and make the objective
n n
PLoss Pi Bij Pj (4) function quadratic and make the constraints
i 1 j 1 linear by omitting the higher order terms.
where Bij „s are the elements of loss coefficient matrix B. 3) Solve the ELD using quadratic programming
recursively to find the allocation and
incremental cost for each plant within limits of
that plant.
III. Quadratic Programming Method
4) If there is no limit violation for any plant for that
A linearly constrained optimization problem with a particular piece, then it is a local solution.
quadratic objective function is called a Quadratic
Program (QP). Due to its numerous applications; 5) If for any allocation for a plant, it is violating the
quadratic programming is often viewed as a discipline limit, it should be fixed to that limit and the
in and of itself. Quadratic programming is an efficient remaining plants only should be considered for
optimization technique to trace the global minimum if next iteration.
the objective function is quadratic and the constraints 6) Repeat steps 2, 3, and 4 till a solution is
are linear. Quadratic programming is used recursively achieved within a specified tolerance.
from the lowest incremental cost regions to highest
incremental cost region to find the optimum allocation.
Once the limits are obtained and the data are rearranged
in such a manner that the incremental cost limits of all IV. Overview of Particle Swarm Optimization
the plants are in ascending order. Natural creatures sometime behave as a Swarm. One
The general quadratic programming can be written as: of the main streams of artificial life researches is to
examine how natural creatures behave as a Swarm and
1 T reconfigure the Swarm models inside the computer.
Minimize f ( x) cx x Qx (5) Kennedy and Eberhart develop PSO based on analogy
2 of the swarm of birds and fish school. Each individual
Copyright © 2012 MECS I.J. Intelligent Systems and Applications, 2012, 12, 12-18
14 Solving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique
exchanges previous experiences among themselves [12]. ND Dimension of the optimization problem
PSO as an optimization tool provides a population
(number of decision variables)
based search procedure in which individuals called
particles change their position with time. In a PSO N par Number of particles in the swarm
system, particles fly around in a multi dimensional
search space. During flight each particles adjust its r1 , r2 Two separately generated uniformly
position according its own experience and the
experience of the neighboring particles, making use of distributed random numbers in the range [0,
the best position encountered by itself and its neighbors. 1]
Vijt w Vijt 1 C1 r1 Pbest ijt 1 X ijt 1
Suitable selection of inertia weight in above equation
provides a balance between global and local
C 2 r2 Gbest it 1 X ijt 1 explorations, thus requiring less number of iterations on
an average to find a sufficient optimal solution. As
i 1,2, , N D ; j 1,2, , N par originally developed, inertia weight often decreases
(7) linearly from about 0.9 to 0.4 during a run.
Using the above equation, a certain velocity, which The algorithmic steps involved in particle swarm
gradually gets close to Pbest and Gbest, can be optimization technique are as follows:
calculated. The current position (searching point in the
solution space), each individual moves from the current 1) Select the various parameters of PSO.
position to the next one by the modified velocity in (7)
using the following equation: 2) Initialize a population of particles with random
positions and velocities in the problem space.
X ijt X ijt 1 Vijt 3) Evaluate the desired optimization fitness
(8)
function for each particle.
where,
4) For each individual particle, compare the
t Iteration count particles fitness value with its Pbest. If the
current value is better than the Pbest value, then
Vijt Dimension i of the velocity of particle j at
set this value as the Pbest for agent i.
iteration t
5) Identify the particle that has the best fitness
X t
Dimension i of the position of particle j at value. The value of its fitness function is
ij
identified as Gbest.
iteration t
6) Compute the new velocities and positions of the
w Inertia weight particles according to equation (7) & (8).
C1 ,C 2 Acceleration coefficients 7) Repeat steps 3-6 until the stopping criterion of
maximum generations is met.
Pbest ijt Dimension i of the own best position of
particle j until iteration t The procedure of the particle swarm optimization
technique can be summarized in the flowchart of Fig. 1.
Gbest ijt Dimension i of the best particle in the
swarm at iteration t
Copyright © 2012 MECS I.J. Intelligent Systems and Applications, 2012, 12, 12-18
Solving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique 15
Pi min Pi max ai bi ci
Unit
If fitness (P) is better than fitness O (Pbest) then (MW) (MW) ($/MW ) 2
($/MW) ($)
Pbest = P
1 50 250 0.00525 8.663 328.13
2 5 150 0.00609 10.04 136.91
3 15 100 0.00592 9.76 59.16
Set best of Pbest as Gbest
V. Results And Discussions Table 2: Best power output for 3-generator system (without loss)
To verify the feasibility and effectiveness of the Pdemand P1 P2 P3 Fcost
proposed PSO algorithm, two different power systems (MW) (MW) (MW) (MW) ($/hr)
were tested one is three generating units [15] and other 250 151.09 42.04 56.87 2959.98
is six generating units [16, 17]. Results of proposed 275 173.00 37.78 64.22 3219.23
particle swarm optimization (PSO) are compared with 300 186.18 52.70 61.12 3483.73
quadratic programming methods. A reasonable B-loss
325 195.85 60.96 68.19 3749.95
coefficients matrix of power system network has been
350 205.57 61.51 82.92 4017.52
employed to calculate the transmission loss. The
software has been written in the MATLAB-7 language. 375 219.67 68.15 87.18 4288.92
400 210.38 89.70 99.92 4563.00
Case Study-2: 6-units system the work of the proposed approach, as shown in Fig. 2.
Characteristics of thermal units are given in Table 4, the
In this case, a standard six-unit thermal power plant
following coefficient matrix Bij losses.
(IEEE 30 bus test system) is used to demonstrate how
Copyright © 2012 MECS I.J. Intelligent Systems and Applications, 2012, 12, 12-18
16 Solving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique
The simulation results with the proposed PSO that the generation output of each unit is obtained
technique respectively are shown in Table 5, Table 6 correction reduces the total cost of generation and
and Table 7 with the variation of loading 600 MW, 700 transmission losses when compared with the
MW and 800 MW. From the simulation results show conventional method (quadratic programming method).
29
28
27
30
25
26
23 24
15 18 19
17 20
21
14 16 22
13 12 10
11 9
1 4 6 8
3
2 5
Copyright © 2012 MECS I.J. Intelligent Systems and Applications, 2012, 12, 12-18
Solving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique 17
Table 5: Best power output for 6-generator system (PD = 600 MW)
Table 6: Best power output for 6-generator system (PD = 700 MW)
Table 7: Best power output for 6-generator system (PD = 800 MW)
VI. Conclusion
This paper presents an efficient and simple approach References
for solving the economic load dispatch (ELD) problem.
[1] A.J Wood and B.F. Wollenberg, Power
This paper demonstrates with clarity, chronological
Generation, Operation, and Control, John Wiley
development and successful application of PSO
and Sons, New York, 1984.
technique to the solution of ELD. Two test systems 3-
generator and 6-generator systems have been tested and [2] Hadi Saadat, Power System Analysis, Tata
the results are compared with quadratic programming McGraw Hill Publishing Company, New Delhi,
method. The proposed approach is relatively simple, 2002.
reliable and efficient and suitable for practical
applications. [3] Z.X. Liang and J. D. Glover. A Zoom Feature for a
Dynamic Programming Solution to Economic
Dispatch Including Transmission Losses, IEEE
Transactions on Power Systems, 1992, 7(2): 544-
550.
Copyright © 2012 MECS I.J. Intelligent Systems and Applications, 2012, 12, 12-18
18 Solving Economic Load Dispatch Problem Using Particle Swarm Optimization Technique
[4] A. Bakirtzis, et al. Genetic Algorithm Solution to Dispatch Problem, MIT International Journal of
the Economic Dispatch Problem, IEE Proc. Electrical and Instrumentation Engineering, 2011,
Generation, Transmission, and Distribution, 1994, 1(2): 93-98.
141(4): 377-382.
[17] M. Sudhakaran, P. Ajay D Vimal Raj, and T. G.
[5] H. T. Yang, P. C. Yang, and C. L. Huang. Palanivelu. Application of Particle Swarm
Evolutionary Programming Based Economic Optimization for Economic Load Dispatch
Dispatch for Units with Non-Smooth Fuel Cost Problems, The 14th International Conference on
Functions, IEEE Trans. on Power Systems, 1996, Intelligent System Applications to Power Systems,
11(1): 112-118. Kaohsiung, Taiwan, 2007: 668-674.
[6] N. Sinha, R. Chakrabarti, and P.K. Chattopadhyay.
Evolutionary Programming Techniques for
Authors’ Profiles
Economic Load Dispatch, IEEE Trans. on
Evolutionary Computations, 2003, 7(1): 83-94. Hardiansyah was born on February 27, 1967 in
Mempawah, Indonesia. He received
[7] W. M. Lin, F. S. Cheng, and M. T. Tsay. An
the B.S. degree in Electrical
Improved Tabu Search for Economic Dispatch
Engineering from the University of
with Multiple Minima, IEEE Trans. on Power
Tanjungpura in 1992 and the M.S.
Systems, 2002, 17(1): 108-112.
degree in Electrical Engineering
[8] K. Y. Lee, A. Sode-Yome, and J. H. Park, from Bandung Institute of
Adaptive Hopfield Neural Network for Economic Technology (ITB), Indonesia in 1996.
Load Dispatch. IEEE Trans. on Power Systems, Dr. Eng, degree from Nagaoka University of
1998, 13(2): 519-526. Technology in 2004. Since 1992, he has been with
Department of Electrical Engineering University of
[9] J. B. Park, K. S. Lee, J. R. Shin, and K. Y. Lee. A
Tanjungpura, Pontianak, Indonesia. Currently, he is a
Particle Swarm Optimization for Economic
senior lecturer in Electrical Engineering. His current
Dispatch with Nonsmooth Cost Functions, IEEE
research interests include power system operation and
Trans. on Power Systems, 2005, 20(1): 34-42.
control, robust control, and soft computing techniques
[10] S.Y. Lim, M. Montakhab, and H. Nouri. Economic in power system.
Dispatch of Power System Using Particle Swarm
Optimization with Constriction Factor,
International Journal of Innovations in Energy Junaidi received B.S. and M.S.
Systems and Power, 2009, 4(2): 29-34. degrees from Bandung Institute of
Technology (ITB) in 1985 and 1992,
[11] Z. L. Gaing, Particle Swarm Optimization to
respectively. Since 1985, he has been
Solving the Economic Dispatch Considering the
with Department of Electrical Engi-
Generator Constraints, IEEE Transactions on
neering, Tanjungpura University,
Power Systems, 2003, 18(3): 1187-1195.
Pontianak, Indonesia.
[12] J. Kennedy, and R. C. Eberhart. Particle Swarm
Currently, he is a senior lecturer in Electrical
Optimization, Proceedings of IEEE International
Engineering. His major research topics include power
Conference on Neural Networks (ICNN’95), 1995,
system operation and economics.
4: 1942-1948, Perth, Australia.
[13] Y. Shi and R. C. Eberhart, Particle Swarm
Optimization: Development, Applications, and Yohannes MS received B.S. degree
Resources, Proceedings of the 2001 Congress on from Bandung Institute of
Evolutionary Computation, 2001, 1: 81-86. Technology (ITB) in 1985 and M.S.
degree from Tanjungpura University
[14] RMS Danaraj and F Gajendran. Quadratic in 2010. Since 1985, he has been
Programming Solution to Emission and Economic with Department of Electrical Engi-
Dispatch Problems, Journal of The Institution of neering, Tanjungpura University,
Engineers (India), pt EL, 2005, 86: 129-132. Pontianak, Indonesia.
[15] M. Vanitha, and K. Tanushkodi. Solution to Currently, he is a senior lecturer in Electrical
Economic Dispatch Problem By Differential Engineering. His major research topics include power
Evolution Algorithm Considering Linear Equality system operation and planning.
and Inequality Constrains. International Journal of
Research and Reviews in Electrical and Computer
Engineering, 2011, 1(1): 21-26.
[16] Anis Ahmad, Nitin Singh, and Tarun Varshney. A
New Approach for Solving Economic Load
Copyright © 2012 MECS I.J. Intelligent Systems and Applications, 2012, 12, 12-18