Optimal Power Flow using Shuffled Frog

Leap Algorithm (SFLA)

ANKESHWARAPU SUNIL
Reasearch scholar ,NIT Warangal
 Optimal power flow(OPF)

 Optimal Power Flow (OPF) is a useful tool in modern Energy Management System.
 Optimal power flow plays an important role in power system planning and operation.
 The OPF optimizes the Power System operating objective function while satisfying a set of
equality and inequality constraints.
 Conventional optimization methods that make use of derivatives and gradients are in
general not able to locate or identify the global optimum.
 To over come the drawbacks of conventional optimization methods, we use genetic
algorithm (GA)
Optimal power flow(OPF)

 OPF finds the Optimal solution to an objective function subject to certain constraints
 Objective functions mainly
1. Cost minimisation
2. Loss minimisation
 Constraints
Active power limits
Reactive power limits
Line flow limits
Voltage limits
Tap limits
Objective function

  Most commonly used for OPF is “Minimisation of total cost of real power generation”.

Generated active powers at bus ‘i’

Number of generators including slack bus
Cost coefficients
Solution Methods

 Conventional Methods
Linear programming method
Quadratic programming method
Gradient method
Newton method
Interior point method
 Heuristic Methods/Intelligent Methods
Artificial Neural Network
Genetic Algorithm
Particle Swarm Optimisation
Ant colony ,Bee colony optimisation techniques…etc
SHUFFLED FROG LEAP TECHNIQUE

 Shuffled Frog Leap Algorithm (SFLA) is a real coded population based meta-heuristic
optimization method

 Mimics the mimetic evolution of a group of frogs when seeking for the location that has the
maximum amount of available food

 It is based on evolution of memes carried by the interactive individuals and a global exchange of
information among themselves.

 It combines the benefits of the local search tool of the Particle Swarm Optimization (PSO) and
mixing information from Parallel Local Searches to move toward a global solution.
 Memeplex formation according to their fitness values

 The entire population of frogs is partitioned into ‘m’ memeplexes according to their fitness
values
Schematic diagram of Shuffled Frog Leap Algorithm
FLOW CHART OF SFLA: Start

Initialise population; Number of memeplexes

Number of frogs in each memeplexes

Calculate objective function and fitness function of each frog

Sorting the population of their fitness values

Divide the population into the memeplexes

Local search

Shuffle the evolved memeplexes

No

No
Termination=true

yes
Determine the best solution

End
Shuffled Frog Leap Algorithm(SFLA)

  Step1:Initialisation
(1) Formation of initial population
(2)’P’ number of frogs generated randomly with in the search place
(3)Read number of memeplexes (n mem),number of frogs in each
memeplexes (no frogs mem)
Total number frogs =(n mem)*(no frogs mem)
(4)Read the active power limits of variables “P”(i.e. and ) for all PV buses
(5)Calculate the objective function and fitness of each search frog
Shuffled Frog Leap Algorithm(SFLA)

  Step2: Grouping of frogs into Memeplexes

(1)Frogs are sorted in descending order according to their fitness value

(2)Entire’ P’ frogs are grouped into ‘m’ memeplexes and each memeplex has ‘n’ number of
frogs

(3)Partitioning of memeplexes is done so that each memeplex consists of lower and higher
fitness values.1st frog goes to 1st memeplex,2nd frog goes to 2nd memeplex and fog goes to
memeplex and goes to 1st memeplex
Shuffled Frog Leap Algorithm(SFLA)

  Step3: Local Search Process and shuffling process

(1)With in each memeplex ,the frogs with worst ( )and best ( )fitness values are identified and
also frog with global fitness( ) is also calculated

(2)The frog with worst fitness moves towards the best frog by a random vector as below
equations
 =rand*( - )
 = +
(3)If there is no improvement in worst frog we use global best value
Shuffled Frog Leap Algorithm(SFLA)

   Di=rand* ( – )
 = + Di
(4) Still no improvement in worst frog we will generate random value of frog

(5) We will do this process for all memeplexes and we will run this number of specific
iterations
(6)After local search all memeplexes are combined into one
Shuffled Frog Leap Algorithm(SFLA)

 Step4: Termination step

(1)The convergence criterion is the condition where fit value of the first frog of first memeplex
is almost same as the fit-value of the last frog of the last memeplex.
SFLA INPUT DATA

 Population size=30
 Number of memeplexes(m)=5
 Number of frogs in each memeplexes(n)=6
 active power limits
 Total number of frogs=m*n
 Here we used real coded values randomly
IEEE-30 Bus System
(Active Power Limits & Gen .Cost Coefficients )
Bus No P min P max ai bi ci
(MW) (MW) ($/hr) ( ()

11 50
50 200
200 00 2.00
2.00 0.00375
0.00375
22 20
20 80
80 00 1.75
1.75 0.01775
0.01775
5 15 50 0 1.00 0.06250
5 15 50 0 1.00 0.06250
8 10 35 0 3.25 0.00834
8 10 35 0 3.25 0.00834
11 10 30 0 3.00 0.02500
11 10 30 0 3.00 0.02500
13 12 40 0 3.00 0.02500
13 12 40 0 3.00 0.02500
Cost for base case NR Load flow
(Q-adjusted)
Bus No Active Fuel Voltage Phase
Power cost($/hr) Magnitude angle
Output(M s(p.u) (degrees)
w)
1 139.36 351.5495 1.0600 -0.000
2 57.56 159.53 1.0354 -2.5564
5 24.56 62.25 1.0058 -8.7640
8 35.00 123.96 1.0362 -6.4809
11 17.93 61.82 1.0500 -6.1658
13 16.91 57.87 1.0500 -7.9666
Total cost 817.0188
$/hr
Cost for after SFLA-OPF

Bus No Active Fuel Voltage Phase

Power cost($/hr) Magnitude angle
Output(M s(p.u) (degrees)
w)
1 179.19 478.7934 1.0600 -0.000
2 46.67 120.3499 1.0338 -3.4892
5 21.30 49.6554 1.0058 -10.3404
8 15.33 51.7876 1.0272 -8.5283
11 13.84 46.3155 1.0500 -8.4552
13 16.87 57.7100 1.0500 -9.4384
Total Totalcost
pg293.2 804.6118
$/hr
Conclusions

 Optimal power flow (OPF) has been solved using Shuffled Frog Leap Algorithm to obtain
the optimal fuel cost .
 Analysis for OPF is carried out on IEEE 30 bus system .
THANK YOU