Hybrid shuffled frog leaping algorithm

and Nelder – Mead simplex search for

optimal reactive power dispatch

Presented by
Muhudin Mohammed
Roll No: EE122618
Under the Guidance of
Sir.Y.Chandrasekar
Department of Electrical Engineering
National Institute of Technology Warangal
Content
 Introduction
Problem formulation
NM-shuffled frog leaping algorithm
Shuffled frog leaping algorithm
NM algorithm
Implementation of NM-SFLA for ORPD
Simulation results
Conclusions
References
 Introduction
Optimal reactive power dispatch (ORPD) has a
great influence on economic operation and
security considerations of power system

Reactive power dispatch optimization determines

•generator voltages
•tap ratios of transformers
•shunt capacitor (or reactor) output
to minimise transmission losses
This minimisation should satisfy a given set of
constraints which come from physical and operational
limitations

Since the generator voltages are continuous variables

whereas the transformer ratios and shunt capacitors
(reactors) are discrete variables, the ORPD problem is
considered as a non-linear multi-modal optimisation
problem with a mixture of discrete and continuous
variables
Con’td

Wide variety of stochastic search methods have been

developed to solve global optimisation problems such
as
Genetic algorithm (GA)
 discovers the promising regions of search space
quickly
two usual drawbacks:
 good local search inability and
 premature convergence
Cnt’d

• Particle swarm optimisation (PSO)

– This algorithm has been widely used in various fields of power system
such as optimal reactive power control , reactive power and voltage
control, power loss optimisation and voltage stability improvement
– may be severely affected by premature convergence and stagnation
problem
• Differential evolution (DE)
– This algorithm is also used to solve variety of problems in power
system
– extracts the differential information from the current population of
solutions to guide its further search
– has no mechanism to extract and use global information about the
search space
 Problem Formulation

The objective function of the ORPD is to minimise the

active power losses

The vector of dependent and control variables are

denoted by X and U, respectively
The minimisation of the above function is subjected
to a number of equality and inequality constraints

Where
Gij is the transfer conductance between buses i and j
Bij is the transfer susceptance between buses i andj
 The inequality constraints on security limits are given by

The inequality constraints on control variable limits are

given by
In the reactive power dispatch problem, control
variables are self-constrained and dependent variables
are constrained using penalty terms to the objective
function
 NM-shuffled frog leaping algorithm

Shuffled frog leaping algorithm(SFLP)

• It can be used to solve many complex optimisation problems,
which are non-linear, non-differentiable and multi-modal

• there is a population of possible solutions defined by a set of

frogs (solutions) that is divided into different subgroups called
memeplexes, each performing a local search

• The convergence criteria can be defined as ollows

1. The relative change in the fitness of the best frog among a number
of consecutive shuffling iterations is less than a pre-specified
tolerance.
2. The maximum user-specified number of shuffling iterations is
reached
Nelder – Mead (NM) algorithm

•designed for unconstrained classical optimisation problems of

minimising an objective function
•The initial simplex S must not lie in the same hyper plane and is
usually constructed by generating N vertices around a given point
as follows

NM method is modified to handle constrained optimisation

Each iteration of modified NM method consists of three parts

1. Ordering: Determine Xb, Xw and Xsw correspond to the

best, worst and second-worst vertices in the current simplex S
2. Centroid: Calculate the centroid of simplex without the
best vector as follows

3.Transformation: Compute the new simplex from the current

one. Try to improve the worst vertex Xw during the three
iterative processes: reflection, expansion or contraction
 Implementation of NM-SFLA for ORPD

To employ the presented algorithm for ORPD problem

• Each frog is a vector containing control variables, that is,
U=[VG TR QC]’ described in Section 2. So,

• each frog is considered as a candidate solution of U. This vector is

shown as X

• Since the control variables must be within a pre-specified limit

,when a new frog is generated (using SFLA or NM method),each
control variable is checked

• To calculate the value of objective function at each iteration , first

the load flow in (2) and (3) must be satisfied that results in the bus
voltages (amplitudes and angles)
Simulation results
 Conclusions

A SFLA approach is developed and integrated with NM algorithm

to create a powerful optimisation tool called NM-SFLA

The advantage of NM-SFLA is its ability in finding high-quality

solutions with fast convergence properties

Experimental results indicate that the NM-SFLA is more effective

in global search exploration and faster than the other applied
algorithms
 References

1. Amiri, B., Fathian, M., Maroosi, A.: ‘Application of shuffled

frog-leaping algorithm on clustering’, Int. J. Adv. Manuf.
Technol., 2009, 45, pp. 199–209

2. Huynh, T.H.: ‘A modified shuffled frog leaping algorithm for

optimal tuning of multivariable PID controllers’. Proc. ICIT,
2008, pp. 1–6

3. Bu¨rmen, A., Puhan, J., Tuma, T.: ‘Grid restrained Nelder–

Mead algorithm ’,Comput. Optim. Appl., 2006, pp. 359–375
4. Zhao, B., Guo, C.X., Cao, Y.J.: ‘A multiagent-based particle
swarm optimization approach for reactive power dispatch’,
IEEE Trans. Power Syst., 2005, 20, (2), pp. 1070–1078