PRESENTED BY

J.C.NEWILYN PAUL CAREY

WHAT IS FROG LEAP ALGORITHM?
• It is an Evolutionary Algorithm developed for solving
optimization problems.
• It does not give the optimum solution but it gives a
near optimum solution in a short amount of time.
• The Frog Leap Algorithm is a method which is based
on observing, imitating, and modeling the behaviour
of a group of frogs when searching for the location
that has the maximum amount of available food .
ALGORITHM-OVERVIEW
1. Population consists of a set of frogs.
2. Partitioned into subsets referred to as memplexes.
3. Each memplexes performing a local search.
After a defined number of evolution steps, ideas are
passed among memplexes in a shuffling process.
4. The local search and the shuffling processes continue
until defined convergence criteria are satisfied.
STEP 1
An initial population of P frogs, generated randomly.

Example
P={X1,X2,X3,…………Xp},
where p=mxn
m- No of memplexes
N-No of frogs per memplex
STEP 2
Sort the population by increasing fitness and divide the frogs into m
memplexes each holding n frogs

The fitness of the frog is

calculated by any given
criteria based on the problem
given.
STEP 3
The frogs evolve within each memplex as they are infected by other
frogs ideas.
• Set m1=0, where m1 counts the number of memeplexes and will be compared with
the total number of memeplexes m.
• Set y1=0, where, y1 counts the number of evolutionary steps and will be compared
with the max number of steps (ymax), to be completed in each memplex.
• Set m1=m1+1; Set y1=y1+1
• For each memplex, the frogs with the best fitness and worst fitness are identified as
Xw and Xb respectively. The frog with the global best fitness Xg is also identified.
STEP 3- CONTD
• The New frog is identified using the formula
Change in frog position(Di) = rand( )× ( Xb-Xw)
New position, Xw= current position Xw + Di
• If the process produces a better frog, it replaces the old frog
• Otherwise, another new frog is identified by replacing Xg instead of
Wb in the above formula.
• If the new frog is not a improvement, then a whole new frog is
selected randomly.
STEP 4
• Check the convergence.
• If the convergence criteria are satisfied, stop.
• Otherwise consider the new population as the initial
population and return to the step2.
• The best solution found in the search process is
considered as the output results of the algorithm.
APPLICATIONS
• Ac-dc optimal power flow.
• Scheduling of construction projects.
• Computer-aided design activities.
• Water distribution network design
THANK YOU