See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/275033907

ALGORITHMS FOR ECONOMIC LOAD DISPATCH

Research · April 2015

DOI: 10.13140/RG.2.1.3413.9683

CITATIONS READS

0 118

1 author:

Krishan Kant
Massachusetts Institute of Technology
22 PUBLICATIONS   164 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Design and Development of Active Power Filter View project

All content following this page was uploaded by Krishan Kant on 16 April 2015.

The user has requested enhancement of the downloaded file.

Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

ALGORITHMS FOR ECONOMIC LOAD DISPATCH

PENALTY PARAMETER-LESS CONSTRAINT HANDLING SCHEME BASED EVOLUTIONARY ALGORITHM

I. INTRODUCTION
Economic dispatch (ED) is an important optimization task in power system operation. Its objective is to minimize the
total generation cost of units by allocating the generation values to each unit, which is in their physical generation limits.
The objective function for this optimization problem is the cost function of a generator. Practical generators have a non-
smooth cost function due to the presence of valve-point effects and the multiple fuel options. This makes the optimization
problem a non-smooth problem. So, it is difficult to solve this type of problem with conventional approaches. For these,
generally Meta heuristic techniques are used. In literature, the constraints are checked in these problems using penalty
function approach, which requires a penalty factor selection, which is a very difficult task. So to avoid this, a penalty
parameter-less constraint-handling scheme was proposed.

II. FORMULATION OF ED PROBLEM

A. ED problem with smooth cost function
With a smooth cost function, the ED problem becomes very simple as shown below in mathematical model.

As the cost function is a smooth function, so, it can be represented as a quadratic function simply
( )
where , and are cost coffecients of generator and is the generated power of generator.
i. Equality Constraint: This is the overall power balance equation. Neglecting losses, the equation becomes

is the total load demand.

ii. Inequality Constraint: These are the generation limits, which must be checked while allocating the generation level to
each generator. This can be represented as

where and are the minimum and maximum power generation of generator.
B. ED problem with non-smooth cost function
1) Non-smooth cost functions with valve-point effects: Generally, the generator cost function is obtained from a data
taken during ‘heat run’ tests. Wire drawing effects, which occur as each steam admission valve in a turbine starts to open,
produce a rippling effect on the unit cost curve. These ‘valve-points’ are illustrated in Fig. 1. To get a accurate cost curve,
this effect should also be incorporated. So this is done by incorporating a sinusoidal function in the smooth cost function
as shown in eq. (5)

( ) | |

where and are cost coefficients with valve-point effect.

2) Non-smooth cost functions with multiple fuel options: The main objective of ‘ED with multiple fuel option’ is to find out
the most economical fuel to burn. For a given fuel, the cost function can be assumed as a simple quadratic function. So for
different fuels the cost function can be represented as piecewise quadratic function as shown in Fig.2 .
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

( )

(6)
3) Non-smooth cost functions with valve-point effect and multiple fuel options: Modelling the cost function such that it
incorprates the effects of both the two will give a better ED solution. So a cost function of below described type is formed:

( ) | ( ( ))|

| ( ( ))|

| ( ( ))|

III. PENALTY PARAMETER-LESS CONSTRAINT-HANDLING SCHEME

To solve the above ED problems formulated, Evolutionary algorithms (EAs) techniques are used as they make use of a
population of solutions, not like the conventional methods which uses a single point solution.
In these techniques, generally the constraints are handled using penalty function approach. The penalty function
approach has many disadvantages, one is that the selection of the penalty factor is itself a big problem, and the solution is
highly dependent on the penalty factor. So a new method is proposed here in which the constraints are handled without any
penalty parameter requirement.
A. Mathematical Model
In this method, the constraints are handled by considering the fact that the constraints which are feasible need not to be
considered, so the fitness function becomes simply the cost function. But, the fitness function, if constraints are not feasible,
becomes only a function of the constraint violated. Thus in such a fitness function, the cost function and the violated
constraint will never come at the same time, thereby avoiding the inclusion of any penalty factor.
So the Fitness function becomes:
̅ ̅ ̅

̅ ∑ ̅

where ̅ is fitness function, ̅ is the objective function, ̅ the jth normalized absolute constraint violations and
the objective function value of the worst feasible solution in the population.
The pair-wise comparison of population used in tournament selection is done as shown in the table
1st Solution 2nd Solution Chosen solution
feasible feasible Better objective function
feasible Non-feasible Feasible
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

Non-feasible Non feasible Smaller constraint violation

1st and 2nd solutions are the two solutions which are to be compared out of the total population.
During the above procedure we never take the objective function and the constraint violation at the same time, so there
is no need of penalty parameter in this type of approach.
B. Verification of technique using KKT conditions
The results obtained using evolutionary techniques may not always be an optimal solution. For any optimization
technique, it is difficult to say that the result obtained is accurate. To verify this, KKT conditions are used. These are the
conditions which every optimal solution must satisfy. So these can be used to verify the solutions obtained from EA
techniques.
The procedure for checking the KKT conditions is modified for a single objective ED problem.

where, is the cost function, h(P) the power balance constraint and the generation limit constraints.
Now KKT conditions are

⃗ ∑ ⃗ ⃗

For infeasible solutions, is expected to be zero and for feasible solutions only this term will be considered.

∑ ⃗ ⃗ ⃗

This equation is analyzed to check that whether KKT conditions are satisfied or not. This is done by finding the KKT
error, which depends upon the data available in (11).
(11) can be taken as matrix equation Ay=b. Where A is an n p matrix.
Now to check the KKT error, there may be different cases depending upon the data of (11).
Case 1: If n > p, means number of equations are more than the unknowns, there may or may not be a solution. To check
this, KKT error is found using least square error as solutions as shown below:
̅
Then the error is calculated as follows
‖ ̅‖
̅
‖ ‖

Case 2: If n < p, then equations are less than unknowns, So it becomes an optimization problem
‖ ̅‖
̅
‖ ‖
where and y are paprmeters of inequality constraints.

Case 3: If n=p, A is a square matrix.

Error can be calculated taking ̅ .
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

‖ ̅‖
̅
‖ ‖
.

REAL-PARAMETER QUANTUM EVOLUTIONARY ALGORITHM

I. QUANTUM EVOLUTION ALGORITHM

Evolutionary algorithms like GA, PSO and others are population based search algorithms. The population formed is
in the binary bits in some variants of the above specified techniques. These bits are binary 0 or 1, deterministic in nature.
But the quantum evolutionary algorithm, as the name suggests, have these basic representatives as probabilities. So the
bits in the quantum computing are called Q-bits. With these Q-bits, the states in the search space are defined
probabilistically.

A Q-bit is represented as [ ] .

The state of a Q-bit is given by | 〉 〉 〉, and are generally complex numbers that represent the
probabilistic state of a Q-bit , but for the problem here, they can easily be taken as real numbers. is the probability
that state will be 0 and is the probability that state will be 1.

Now in an evolutionary algorithm we take a population and each individual is represented with bits, in this case it will
be Q-bits. So a string of Q-bits is used to represent each individual as shown below:

As our digital computers cannot account for the superposition of two states, so whenever such a string is fed to the
computer, it will collapse the superposition and gives only one result either ‘0’ or ‘1’, which is again a probabilistic event.
From this string we generate a binary string which is used for further evaluating the fitness function and then proceeding
towards the optimum in the search space by updating after each iteration.

II. REAL-PARAMETER QUANTUM EVOLUTION ALGORITHM

Now this technique is very good for the problems having parameters in binary(0 or 1). But the economic dispatch
problem is a real valued parameter based problem. So the concept has to be modified. So we require a Real-Parameter
Quantum Evolutionary Algorithm (RQEA).

This can be done in different ways. One way is that to represent each real parameter with a string of Q-bits. And then
these strings are collapsed to form a binary string and then this binary string may be used for further processes. But this
has a problem as the level of discretization increases with the functions having steep changes. So the representation of
parameters becomes very difficult and large memory is required to save them.

Here is presented a more sophisticated approach to work with real parameters. This technique also uses a population,
in which individual is represented with a string of Q-bits. Let there is a set of Np Q-bit strings, each having Ng number of Q-
bits. In tth iteration these strings can be represented as Qit , i  [1, N p ] and each Qit has Ng Q-bits representing probability
amplitudes . Correspondingly there is another set Pi t , i  [1, N p ] with Np strings and each string having Ng real numbers.
The probability of generating a real number on the higher (lower) side of current value is given by . To make
these equal at the starting we initialize both with the 0.707. The elements of Pi t are initialized with any random value
within the limits of that parameter. Each pair consisting Qit and Pi t represent the ith family in tth iteration.
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

A. Evolving Q-bits
In QEA, the observed value of Q-bit is either 0 or 1. But in RQEA the observed value of Q-bit is another Q-bit with the
different amplitute of probability than the original Q-bit, that leads to a new superpositioned state. Then this new state is
transformed into the real parameters using neighbourhood operators.

1) Neighbourhood Operator 1: In tth iteration, NO1 generates solution strings pijt (j  1,2,..., N c ) , each having Ng
elements, using Qit . This is done for a particular i, j as follows:

An array Rij is created with Ng elements generated at random such that every element in R ij is either +1 or -1. Let ρijk be the
kth element in Rij. Then  ijk
t
is given by
 ijkt   ijkt 1   ijk  ' '
Where δ the alteration in angle and  ijk
t
is the rotated angle which is given as tan
1
(  ijk /  ijk ) . δ is randomly chosen in
the range [0,  ijk
t 1
] if ρijk = -1 and in the range [  ijk
t 1
,π/2] if ρijk = +1.
The new probability amplitudes,  'ijk and  ' ijk , are calculated using rotation gate as
 t ijk   cos sin    t 1ijk 
 t   
  ijk   sin  cos    t 1ijk 
These probabilities are then transformed to solution space to determine individual element as
Pijkt  ( ijk
t
) 2 ( Pk max  Pk min )  Pk min

Where Pk max and Pk min are the maximum and minimum allowable values.

2) Neighbourhood Operator 2: This step is added to exploit the search space and generates the neighbour string
between Pj and PBest. Here the point is calculated as
Pijkt  ( ijk
t
) 2 ( Pk max  Pk min )  Pk min
Where Pkmax =max(PBest ik , Cit), and Pkmin =min(PBest ik , Cit). Here Ci is the best child of the ith family in tth iteration.

B. Updating Q-bit string

Updating Q-bit string means each element of the string has to be updated so that the probability of the current string
increases in the direction to reach the current best solution in every iteration. A learning rate is defined to change the
probabilities of the current string. It works as follows:
 t 1i   cos( i ) sin( i )   t i 
 t 1     t 
  i   sin( i ) cos( i )   i 

This type of updating is done in minimization problem.

The choice of ( i ) is further explained below:

C. Migration
In the proposed technique, two levels of migration are incorporated, local and global. In local migration, one randomly
chosen Pt is used to update some Qit. In global migration, PBEST is used to update Qit (i  1,2,..., N p ) .
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

III. ELD PROBLEM

Here in ELD problem, we take the cost function as a quadratic one with valve-point effects. In the ELD problem, we want to
find out the generation levels for minimum cost. So RQEA provides an excellent framework for designing of such a
problem. Since the application of NO1 or NO2 on the Q-bit string can result in any one of the 2n-1 possibilities that n-1
independent generators have 2n-1 directions to go (increase/decrease) , thus n-1 Q-bit string gives a complete
representation of the space of possible changes.
Inequality constraints are checked automatically during converting Q-bits into real value using P limits of generators and
Equality constraints are handled automatically when we take n-1 generators in solution string and find n th generation
from power flow analysis. This method is good as it requires very little population.
Economic-emission load dispatch using binary successive approximation-based
evolutionary search

I. ELD PROBLEM
Economic load dispatch problem works to minimize the cost of generation and NO x emission, with power balance and
generation limits constraints. It also takes into consideration the valve-point effects, ramp rates of generators, prohibited operating
zone (POZ). So the objective function becomes

∑ | ( )|

Additional constraints can be added to include the POZs and Ramp rates. These are:

( ) ( )

Additional constraints can be added to incorporate the POZs

( )

Where lower/upper bound of jth prohibited zone of ith generator; is the number of prohibited zones in ith
generator.
As there are two objective functions, so, to incorporate both we use weighting method.

∑ ∑

These weights are regulated to get the solution. Considering the imprecise nature of the Decision Maker’s
judgment, it is assumed that the DM may have fuzzy goals for each objective function. So fuzzy objective
functions are handled using membership functions. DM determines this considering the minimum and
maximum values of each objective function together with the rate of increase of membership satisfaction.
So the membership function will be:
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

The decision regarding the best solution is made by applying the min–max of membership function as
defined below:
[ { } ]

The solution with highest membership will be considered as the best solution.

II. CALCULATION FOR SLACK GENERATOR

Let there be a randomly selected generator as dependent generator. Now to maintain the overall power balance, its
generation must be cheked.
Let the transmission loss is represented as

∑ ∑∑

Putting this in power balance equation we get the following equation in terms of dependent generation.

so this equation must have real roots for the solution of .

III. BINARY SUCCESSIVE ALGORITHM BASED EVOLUTIONARY SEARCH METHOD

A direct search is used to describe a sequential examination of trial solutions. The procedure of going from a given point to
the next improved point is called a ‘move’. Depending upon the value of the objective function, a move is defined as
‘success’ or ‘failure’. In search for optimum solution, the search is processed by two moves, one move is required to get the
behavioral information about the function called Exploratory move and the other is required to move in that particular
direction called Pattern move.
A. Exploratory move : If there are Ng number of generators, then there are 2(Ng-1) directions(considering only
independent generators) to move from the current operating point. This is done by creating a 2 (Ng-1) dimensional
hypercube of side length equal to the amount of perturbation, with the vertices as possible solutions. All these vertices are
represented as binary numbers of length as (N g-1). So all these vertices are checked simultaneously whether move is a
success or failure. So iteratively, another hypercube is formed around that point which is result of a ‘success’ move.

This method is called evolutionary search. This method of finding success move for each vertex becomes very difficult and
computationally demanding if the number of generators are large.

So to reduce this computational burden, we use BSA strategy to exploit the search space. In this approach the solution
procedure moves towards the optimal solution by comparing two solutions at a time represented by two corners of the
hypercube as shown in figure for a 4 generator case.
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

This procedure is repeated till all the corners of the hypercube are checked and the overall best solution is taken for
the next iteration and another hypercube is forms around that point.
B. Pattern move : This move is the movement from the current best solution to the next point in the direction that we get
from the information in the exploratory move. Exploratory move gives the direction in an established pattern.

Hybrid Differential Evolution with Biogeography-Based Optimization for

Solution of Economic Load Dispatch

I. ELD PROBLEM
ELD problems for this technique are same as that defined in the previous section for BSA-ES approach. Here the technique is
discussed without going into much details of the problem.

II. DIFFERENTIAL EVOLUTION

Differential evolution is also a population based evolutionary algorithm. In this technique, offsprings are produced as trial
vectors from the parent population and these are improved by three basic operators: mutation, crossover and selection.
The process of DE is described below:
A. Initialization: A population is generated randomly such that the individuals are within their constraints.
( )
Where Np is the size of the population and D is the number of decision variables.
B. Mutation: This step is analogous to generation of offsprings. The mutation step is carried out by creating a mutant
vector. A mutant vector is created by perturbing a randomly selected vector with the difference of two other
randomly selected vectors and at the kth iteration as shown below :

, and are randomly selected variables and this step is performed again for each parent vector. F x[0,2] is a scaling
factor, used to control the amount of perturbation in the mutation process and improve convergence.
C. Crossover: It represents genes exchange. A trial vector is created from the parent vector by mixing the parent vector
with the mutant vector. In this process, the trial vector is formed such that it has atleast one element different from the
parent vector.

[ ] is the “Crossover constant” that controls the diversity of the population and aids the algorithm to escape from
local optima.
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

D. Selection: Selection is done on the basis of the acheivement of the objective function. The target vector and the trial
vector are compared for the objective function and the better one is selected for the next iteration.

III. BIOGEOGRAPHY-BASED OPTIMIZATION

Biogeography describes how species migrate from one island to another, how new species arise, and how species become
extinct. A habitat is any Island (area) that is geographically isolated from other Islands. Migration of some species out of
one habitat into
another is known as emigration. When some species enters into one habitat from some other habitat, the process is known
as immigration. Areas that are well suited as residences for biological species are said to have a high habitat suitability
index (HSI).
The variables that characterize habitability are called suitability index variables (SIVs). SIVs can be considered as the
independent variables of the habitat, and HSI can be calculated using these variables.

Before optimizing, each individual of population is evaluated and then follows migration and mutation step to reach global
minima.
A. Migration:
In migration, the information is shared between habitats that depend on emigration rates and immigration rates of each
solution.
Mathematically the concept of emigration and immigration can be represented by a probabilistic model. Let us consider
the probability Ps that the habitat contains exactly s species at t. Ps changes from time t to time t+∆t as follows:

Where and are immigration and emigration rates with S species in the habitat.
This equation is formulated by assuming that within ∆t time interval at most one specie is immigrated or emigrated. Due
to this one following will be the path by which present scenario has reached(S species at time t+∆t):

a) At time t, S species were there, no immigration, no emigration, so S species at time t+∆t.

b) At time t, (S-1) species were there, one immigration, no emigration, S species at time t+∆t.
c) At time t, (S+1) species were there, no immigration, one emigration, S species at time t+∆t.

Now If the time ∆t is very small, and assuming that there cannot be more than one migration in ∆t time period, so
probabalities become:

Assuming linear nature of migration curve, the λ and μ which are functions of number of species ’k’ can be expressed as
follows:
( )
where E=maximum λ , I=maximum μ , P=population size, as linear curves , so E=I.

So the habitats having high HSI will have high emigration rate and low immigration rate due to saturation of habitat with
species. So this means that the bad solutions are not allowed to share their features as the emigration rate to these is very
low and they accept useful information from good solutions, which improves exploitation ability of algorithm.

Migration Algorithm:
Select Hi with probability α λi
If Hi is selected
For j=1 to P
Select Hj with probability α μi
If Hj is selected
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

Randomly select an SIV σ from Hj

Replace a random SIV in Hi with σ

B. Mutation: It is done to increase the diversity of the population to get the good solutions. Mutation operator replaces the
SIV of a habitat with some randomly generated SIVs.

Mutation Alogorithm:
For I = P/2 to P
For j = 1 to N
Use λi and μi to compute the probability Pi
Select SIV Hi(j) with probability α Pi
If Hi(j) is selected
ReplaceHi(j) with a randomly generated SIV within its feasible region

IV. HYBRID DIFFERENTIAL EVOLUTION WITH BIOGEOGRAPHY-BASED OPTIMIZATION

DE has been found to yield better and faster solution but it is inefficient in mapping all unknown variables together for a
large and complex system. This problem is due to crossover operation, due to which the solutions which are initially good
may loose their in later iterations. But BBO doesn’t have any crossover operation and also the migration operation finely
tune the solutions, so they are always improving. So a new technique is defined to use the strengths of both these
techniques, which are that DE has good exploration ability in finding the region of global minimum and BBO has good
exploitation ability in global optimization.
A. Hybrid Migration Operator: In this algorithm child population takes new features from both the above described
techniques. These are mutation operation of DE, migration operation of BBO and corresponding parents of offspring.
Due to the hybrid nature of the process, it has advantage of DE that it wouldn’t let good solutions to get removed and
that of BBO that it makes the worst solution to adopt the features of the good solution by migrations.
B. Procedure: Procedure will be better understood by the algorithm shown below:
1) Generate the initial population P
2) Evaluate the fitness for each individual in P
3) while the termination criterion is not satisfied
4) For each individual calculate species count probability
5) For each individual calculate Immigration rate λ and emigration rate μ
6) Modify the updated population with the Hybrid Migration operation
7) for i=1 to NP
8) Evaluate the offspring Ui.
9) if Ui is better than Pi
10) Pi = Ui

Neighborhood Search-Driven Accelerated Biogeography-Based Optimization for

Optimal Load Dispatch
Lack of exploration capability of biogeography based optimization (BBO) leads to slow convergence. A memetic algorithm
(MA), namely, aBBOmDE, which is a new version of BBO is described which can solve both complex and non-complex
economic load dispatch problems. In aBBOmDE, improvement is made in the process of mutation and also additional step is
added which is clear duplicate operators. Then, modified DE (mDE) is embedded as a neighborhood search operator to improve
their fitness after a predefined threshold.

I. ELD PROBLEM
ELD problems for this technique are same as that defined in the previous section for BSA-ES approach.
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

II. aBBOmDE

BBO has been explained in the previous section, so here only modifications are discussed. The migration process is same as that
of simple BBO, but there is a change in mutation and further processes.

A. Modified Mutation Operator: As in BBO, in mutation step, the solutions are replaced randomly. So this causes a large
number of infeasible solutions to come in the solution population which makes the optimization process slow. To remove this,
muttion step is modified and now the the parent individual is combined with the scaled differences of parent individual and
randomly selected other individuals of the same population vectors.

Where is the parent SIV, is arandom SIV, is a scaling factor.

Now the replacement is not totally randomised thus the schemes tends to increase the diversity among the population. Also as the
large no. of infeasible solutions will not be there so the convergence becomes faster.

B. Modified Clear Duplicate Operators: In BBO, migration process creates harmful similar habitats. In BBO, this similar
habitat is modified to a new solution by simply replacing one of the SIVs of similar habitat randomly within the feasible range,
which slows down the algorithm. However, in aBBOmDE, the similar habitat is modified to a new solution Hi by replacing one of
the SIVs (Hi(j)) with feasible solution generated by controlling the amount of diversity between maximum and minimum SIVs of
the two similar habitats and is expressed as
Hi(j) = min(Hi) + (max(Hj)−min(Hi))×rand

C. Modified Differential Evaluation: In this memetic approach, mDE is used as a neighborhood search operator. Although DE
is good at locating the region of global minimum, the performance of DE is good if the global optimum is located using limited
NFFEs(Number of Fitness Function Evaluations). mDE is made active after the predefined threshold. This threshold has been set
in terms of MAXNFFEs. The habitats are regarded as DE individuals after hitting the threshold limit. In original DE, all the
individuals go through DE pro-cess to generate the individuals for the next generation. Here mDE generates possible feasible
habitat through limited number of DE refinements, not all the particles are taken for DE. Feasible habitat are generated using
following in DE:

1) The main characteristics of DE is its mutation operator. DE with mutation operator is embedded as a neighborhood search
operator to explore the search near the best solution. So the mutation operator is expressed as:

Where represents the best individual in the current generation and xr1, xr2 are two other randomly selected individual. Thus,
the operator generates the offspring close to global optimum. Fcontrols the amplification of the difference vector.

2) In crossover operation, mutant vector vi is mixed with randomly selected target vector xr3(as refinements are done for less
number of particles) to yield trial vector ui. In selection scheme, the better fitness trial vector replaces the target. Thus, mDE-
generated offspring refines the habitat better.

3) The parameter choice is very important in DE. DE is more sensitive to the choice of F than to that of CR. So F iscalculated
as follows:
First a feedback factor is calculated representing current evaluation status probabilistically.
( ( ))

{ ( )
Then FF is calculated as
Fi=rand3.FF
Where t1 represents probability to adjust factor FF. rand j, j {1,2,3}are uniform random values [0.1, 0.9].
Technical Report Submitted By: Krishan Kant
Submitted to: Prof. P. R. Bijwe, EE Dept., IIT Delhi

4) The length of LS (Ln) is also critical as too short length may be unsuccessful in exploring the neighborhood of the solution
and too large length increases the NFFEs unnecessarily. So this length should be chosen wisely.

Reference Papers

[1] Penalty parameter-less constraint handling scheme based evolutionary algorithm solutions to economic
dispatch, Manoharan, P.S., Kannan, P.S.; Baskar, S.; Iruthayarajan, M.W., Generation, Transmission & Distribution,
IET, July 2008

[2] Real-parameter quantum evolutionary algorithm for economic load dispatch, Babu, G.S.S. ; Das, D.B. ; Patvardhan, C.
Generation, Transmission & Distribution, IET, 2008

[3] Economic-emission load dispatch using binary successive approximation-based evolutionary search, Dhillon, J.S.,
Dhillon, J.S., Kothari, D.P., Generation, Transmission & Distribution, IET, 2009

[4] Hybrid Differential Evolution With Biogeography-Based Optimization for Solution of Economic Load
Dispatch, Bhattacharya, A., Chattopadhyay, P.K., IEEE Transactions on Power Systems, 2010

[5] Neighborhood Search-Driven Accelerated Biogeography-Based Optimization for Optimal Load Dispatch,
Lohokare, M.R., Panigrahi, K.B., Pattnaik, S.S., Devi, S., Mohapatra, A., IEEE Transactions on Systems, Man, and Cybernetics,
2012

View publication stats