Republic of the Philippines

Mindanao State University - Iligan Institute of Technology

College of Engineering
Tibanga, 9200 Iligan City, P.O. Box No.5644 Tel. Nos. (063) 221-4050 Loc.130
Direct line (063) 2351E-mail:fbalagao@yahoo.com

EE 101 Power System Operations and Control

Term Project

OPTIMAL ECONOMIC LOAD DISPATCH USING

NOVEL BAT ALGORITHM

In partial fulfilment
Of the requirement in
EE 101

FEN JEAN-NETTE V. BARLISAN

MARY DHOVES V. YONSON

PROF. ROGELIO. F. BERSANO JR.

Instructor

15 December 2016
ABSTRACT

asfdf

TABLE OF CONTENTS

ABSTRACT
TABLE OF CONTENTS
LIST OF TABLES
LIST OF FIGURES
LIST OF ABBREVIATIONS, SYMBOLS AND NOMENCLATURE
CHAPTER 1: INTRODUCTION
1.1. Background of the Project
1.2. Statement of the Problem
1.3. Objectives of the Project
1.4. Scope and Limitations of the Project
1.5. Project Organization
1.6. Theoretical Framework
CHAPTER 2: LITERATURE REVIEW
2.1. Optimum Economic Dispatch
2.2. Generator Operating Cost
2.3 Mathematical Formulation of ELD Problem
2.3.1. ELD Problem Objective Function
2.3.2. System Constraints
2.4. Bat Algorithm
2.4.1. Pseudo code of Bat Algorithm
2.4.2. Flowchart of Bat Algorithm
2.5 Novel Bat Algorithm

CHAPTER 3: METHODOLOGY

3.1. Model design of the power system

3.2. Novel Bat Algorithm an Optimization Tool
3.3. Pseudo Code of Novel Bat Algorithm
CHAPTER 4: RESULTS AND DISCUSSION
4.1. Result of Novel Bat Algorithm
4.2. Analysis and Discussion of Novel Bat Algorithm
CHAPTER 5: CONCLUSION
5.1. Summary of the Project
5.2. Recommendation
REFERENCES
APPENDICES

LIST OF TABLES

Table No.

Table Description

Table 1
Sad

LIST OF FIGURES

Page

Fig. No.

Figure Description

Page

Fig. 1
asdasd

LIST OF ABBREVIATIONS, SYMBOLS AND NOMENCLATURE

ELD- Economic Load Dispatch

BA- Bat Algorithm
NBA- Novel Bat Algorithm
PSO- Particle Swarm Optimization
IWD- Intelligent Water Drops
MBA- Modified Bat Algorithm

CHAPTER 1
INTRODUCTION

1.1 Background of the project

asd
1.2 Statement of the problem
In this paper, the objective function of economic load dispatch problem is to
optimize the power generation that minimize the total generation cost while
satisfying all constraints. These constraints may be the equality constraints or the
inequality constraints. In other words, the articulation of the mathematical
program, which is, from equations ASFVKFVLA
1.3 Objectives of the project
The main objective of the project is to optimize economic dispatch using a
meta-heuristic method specifically bat algorithm. The project aims to implement
bat algorithm in economic load dispatch problem and to solve economic load
dispatch. The program will be implemented using MATLAB 2013a for the
algorithm for bat algorithm.
1.4 Scope and Limitations of the project
The scope of the project will be discussed about economic load dispatch with
or without the consideration of transmission loss. A meta-heuristic method, bat
algorithm, will be used in this project to analyze the cost function by investigating
the fuel cost of each generator and the total cost needed in order to generate the
desired power demand. The high-level programming language used for analysis is
MATLAB 2013 a. The size of the power system and the amount of generators
which are involved in the research will be determined according to the practical

case by considering the equality constraint and inequality constraint. The power
system will be referred to IEEE standard bus system. In the analysis part, the
IEEE 5 generators 14 bus test system will be involved.
1.5 Project Organization
This project consists of 5 chapters. Chapter 1 discuss about the introduction
which were background, problem statement, objectives, significance, scope and
limitations of the research. Chapter 2 discuss about the literature review of
relevant studies where the background of economic dispatch and methods were
being reviewed. Chapter 3 was the methods of Bat Algorithm will be discussed. In
chapter 4, the result, analysis and discussion will be shown. After that, chapter 5
will discuss about the conclusion and recommendation of the project based on the
analysis part.
1.6 Theoretical framework
1.6.1. Mathematical Formulation of ELD Problem
1.6.1.1. ELD Problem Objective Function
The objective behind economic load dispatch (ELD) is to maintain the
generating units in such a way that, it should meet the load demand with a
minimum operating cost and satisfy all the constraints. This can be simplified by
minimizing the total fuel cost of all units combined subjected to the constraint
given in equation 1.

Fi(Pgi) = min

F i P gi
i=1

(1)
Fi(Pgi) is the fuel cost equation of the ith plant and N is the total number of
generating units. This shows the variations of power generation with fuel cost.
(Pradesh & Pradesh, 2015) Describing mathematically, the simplified cost
function of every generator can be represented as a quadratic function as given in
equation 2. (Sahu & Swarnkar, 2014)
Fi(Pgi) = aiPgi2 + biPgi +ci
(2)
Here:
ai, bi, ci are the known coefficients; for ith unit
N: number of generators
Pgi: real power generation of ith plant;
Fi(Pgi): total cost of generation
1.6.1.2. System Constraints
There are two types of system constraints: equality constraints and inequality
constraints.
a. Equality Constraints
sa
b. Inequality Constraints
Dfa

1.6.2 MATLAB

MATLAB is widely used in all areas of applied mathematics, in education

and research at universities, and in the industry. MATLAB stands for MATrix
LABoratory and the software is built up around vectors and matrices. This makes
the software particularly useful for linear algebra but MATLAB is also a great tool
for solving algebraic and differential equations and for numerical integration.
MATLAB has powerful graphic tools and can produce nice pictures in both 2D
and 3D. It is also a programming language, and is one of the easiest programming
languages for writing mathematical programs. MATLAB also has some tool boxes
useful

for

signal

processing,

image

processing,

optimization,

(http://www.math.utah.edu/~wright/misc/matlab/matlabintro.html)

CHAPTER 2
REVIEW OF RELATED LITERATURE
2.1. Optimum Economic Dispatch

etc.

In conventional economic load dispatch, cost function for each generator

is represented by a single quadratic function and is solved using lambda iteration
method, Newton method, gradient-based method, etc. These methods require
incremental fuel cost curves which are piecewise linear and monotonically
increasing to find the optimal solution. For generating units, which actually
having non-monotonically incremental cost curves, conventional methods ignores
or flattens out portions of incremental cost curve that are not continuous or
monotonically increasing. Unfortunately, input-output characteristics of modern
units are inherently highly non-linear because of valve point loadings, ramp rate
limits, prohibiting operating zones resulting in multiple local minimum points in
the cost function. So, their characteristics have to be approximated to meet
requirements of classical dispatch algorithms. However, such approximations may
lead to huge loss of revenue over the time. Classical methods like Newton-based
and gradient methods cannot perform very well for problems having highly
nonlinear characteristics with large number of constraints and many local
optimum solutions. Thus, developing a reliable, fast and efficient algorithm is still
an active area for research in power systems. Various investigations on ELD have
been explored till date, as better solutions would result in significant economical
benefits like particle swarm optimization (PSO), genetic algorithm (GE), krill herd
algorithm , artificial bee colony (ABC) are used. Yang et al. presented a
mathematical programming based method named quadratic ally constrained
programming (QCP) to solve non-smooth and non convex ELD problem. Dervis

developed artificial bee colony (ABC) optimization technique to solve multi-area

economic dispatch (MAED) problem considering tie line constraints and
nonlinearities like multiple fuels, valve point loading and prohibited operating
zones. Cai et al. developed a fuzzy adaptive chaotic ant swarm optimization
(FCASO) algorithm for solving the ELD problems of thermal generators in power
systems. (Makkar, 2016)
2.2. Generator Operating Cost
The total cost of operation includes the cost of labour, fuel cost,
maintenance and supplies. Generally, cost of labour, supplies and maintenance are
fixed percentages of incoming fuel costs. The throttling losses are large when a
valve is just opened and small when it is fully opened. The power output of fossil
plants is increased sequentially by opening a set of valves to its steam turbine at
the inlet
Boiler

Turbine

Generator

Fuel Input

Fig. 1 Simple model of fossil plant

Figure 1 shows the simple model of fossil plant dispatching purposes. The
operating cost of the plant has the form shown in Figure 2. The cost is usually
approximated by one or more quadratic segments.

y()

x()
Fig. 2 Operating costs of fossil fired generator
The discontinuities occur when the output power is extended by using
steam condensers, additional boilers, or other equipment. The fuel cost curve may
have a number of discontinuities. Within the continuity range the incremental fuel
cost may be expressed by a number of short line segments or piece-wise
linearization. They may also appear if the cost represents the operation of an entire
power station, and so that cost has discontinuities on paralleling of generators. The
Pgi min is the minimum loading limit below which, operating the unit proves to
be uneconomical (or may be technically infeasible) and Pgi max is the maximum
output limit. (Sahu & Swarnkar, 2014)
2.3. Bat algorithm
Bat algorithm is a meta-heuristic optimization algorithm developed by
Xin-She Yang in 2010.This bat algorithm is based on the echolocation behavior of
microbats with varying pulse rates of emission and loudness.

2.3.1. Pseudo code of bat algorithm

Objective function f(x), x=(x1,x2,,xd)T
Initialize the bat population xi and velocities vi for i=1, 2, , n
Initialize frequencies Qi, pulse rates ri and the loudness Ai.
while (t<maximum number of iterations)
Generate new solution by adjusting frequency, and updating velocities and
locations/

solutions by using these formulas

if (rand(0,1)>ri)
Select a solution among the best solutions. Generate a local
solution around the best solution.
endif
Generate a new solution by flying randomly.
if (rand < Ai && f(xi)<f(xbest))
Accept the new solutions, increase ri and reduce Ai.
end if
Rank the bas and find the current best xbest.
end while
Post process results and visualization. The algorithm stops with the total-best
solution.
2.3.2. Flowchart of bat algorithm
This will show the workflow of a simple BA.

Start

Initial parameters and solutions: population pop;

solution X, V; pulse frequency fi,
pulse rate ri; loudness Ai, etc.

Fitness evaluation

Generate global solution

Generate local solution

Update solution by global + local solutions

No
Convergence
Yes
End

2.4. Related works using bat algorithm

The study of Reddy et. al in the year of 2015, they used a new meta
heuristic method bat algorithm for solving the economic load dispatch problem.
They compared BA, PSO and IWD methods with valve point effect and
prohibited zone constraint. They observed that bat algorithm is more superior than

the two methods although PSO and IWD gave nearly the same result. Many
methods consisting of conventional approach and artificial intelligence approaches
are used for optimization of the critical problem Economical Load Dispatch.
This is an extension work in the same axis. Although the proposed algorithm had
been successfully applied to ELD with valve-point loading effect and included a
few constraints, the practical ELD problems should consider multiple fuels as well
as spinning reserve, power flow constraint and ramp up & down rate constraints
and also for hydrothermal scheduling problems. This remains a challenge for
future work.(Reddy, 2015)
The paper of Latif and Palensky in the year of 2014, proposed two
modifications to the original bat algorithm. The modified algorithm is then tested
for solving the economic load dispatch problem and was compared with various
metaheuristic optimization techniques. The proposed modifications improved the
results. One important observation from the results of all three experiments is that
MBA achieved the lowest standard deviation. It can hence be deduced that MBA
is the most robust algorithm for the experiments performed. This work can be
extended to test the algorithms robustness for high dimensional problems or for
multi objective optimization problems. (Latif & Palensky, 2014)
2.5. Novel Bat Algorithm
In the original BA, the Doppler effect was not considered. The foraging
habitats of bats were not also taken into account. In BA, each virtual bat depicted
by its position and velocity searches its prey in a D-dimensional space, and its

trajectory is obtained based on the classical mechanics. The motion region of the
virtual bats would be confined to a finite zone by the bound state constraint. This
means, in a sense, the virtual bats would forage in one habitat. However, this is
not the case in reality. Intuitively speaking, the closer the algorithm approximates
to the actual situation, the more efficient the algorithm works. In the proposed
algorithm, Doppler effect has been incorporated into the algorithm. Each virtual
bat in the proposed algorithm can adaptively compensate for the Doppler effect in
echoes. Meanwhile, the virtual bats have diversified foraging habitats. The virtual
bats in the original BA search for their food at one habitat due to their mechanical
behaviors. However, the ones in NBA can forage in different habitats. Moreover,
the virtual bats in NBA have the quantum behavior except mechanical behavior. A
particle with quantum behavior can appear at any position in the whole search
space with a certain probability (Sun et al., 2012). Thus the virtual bats in NBA
can forage in a wider range of habitats than the ones in BA. This is the reason that
the quantum theory can be introduced into BA. By modeling the habitat selection
as the selection between the mechanical behavior and the quantum behavior, the
virtual bats in NBA can move between different habitats.
In order to formulate the proposed algorithm mathematically, two more idealized
rules except the idealized rules in original BA are proposed.
(1) All bats can forage in different habitats, depending on a stochastic selection.
(2) All bats can compensate for Doppler effect in echoes. They can adaptively
adjust the compensation rate according to the proximity of their targets.

Given the aforementioned description, the proposed algorithm can be explicitly

formulated (Meng, Gao, Liu, & Zhang, 2015). The pseudo code of the NBA is
presented in chapter three.

CHAPTER 3
METHODOLOGY
3.1. Model design of the power system
asd
3.2. Novel Bat Algorithm an Optimization Tool
asd
3.2.1 Pseudo Code of Novel Bat Algorithm

The pseudo code of the NBA is presented by Meng (Meng et al., 2015) as follows:
Input: N: the number of individuals (bats) contained by the population
M: maximum number of iteration
P: the probability of habitat selection
W: inertia weight
C: the compensation rates for Doppler Effect in echoes
: contraction-expansion coefficient
G: the frequency of updating the loudness and pulse emission rate
, , fmin, fmax, A0, r0, parameters in basic BA
t=0; Initialize the population and the related parameters. Evaluate the objective
function value of each individual.
while (t<M)
if (rand(0,1) < P)
Generate new solutions using Eq. 17
else
Generate new solutions using Eqs 18-21
endif
if (rand(0,1)>ri)
Generate a local solution around the selected best solution using equations
endif
Evaluate the objective function value of each individual.
Update solution, the loudness and pulse emission rate using Eqs. (7)-(10).
Rank the solutions and find the current best gt
if gt does not improve in G time step.

Reinitialize the loudness Ai and set temporary pulse rates ri, which
is a uniform random number between [0.85,0.9].
endif
t=t+1
endwhile
Output: the individual with the best objective function value in the population.

CHAPTER 4
RESULTS AND DISCUSSION
4.1 Result of Novel Bat Algorithm
adad
4.2 Analysis and Discussion of Novel Bat Algorithm
asdasd

CHAPTER 5
CONCLUSION
5.1 Summary of the Project
sdf
5.2 Recommendation
Asd

REFERENCES

APPENDICES