Scribd
Upload
290 views15 pages

OPTIMIZATION-Shuffled Frog Leaping Algorithm

The difficulties associated with using mathematical optimization on large-scale engineering problems have contributed to the development of alternative solutions. Linear programming and dynamic programming techniques, for example, often fail (or reach local optimum) in solving NP-hard problems with large number of variables and non-linear objective functions. To overcome these problems, researchers have proposed evolutionary-based algorithms for searching near-optimum solutions to problems. Evolutionary algorithms (EAs) are stochastic search methods that mimic the metaphor of natural biological evolution and/or the social behaviour of species. Examples include how ants find the shortest route to a source of food and how birds find their destination during migration. The behaviour of such species is guided by learning, adaptation, and evolution. To mimic the efficient behaviour of these species, various researchers have developed computational systems that seek fast and robust solutions to complex optimization problems. The first evolutionary-based technique introduced in the literature was the genetic algorithms (Gas). GAs were developed based on the Darwinian principle of the ‘survival of the fittest’ and the natural process of evolution through reproduction. Based on its demonstrated ability to reach near-optimum solutions to large problems, the GAs technique has been used in many applications in science and engineering. Despite their benefits, GAs may require long processing time for a near optimum solution to evolve. Also, not all problems lend themselves well to a solution with GAs.

Uploaded by

Uday Wankar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
290 views15 pages

OPTIMIZATION-Shuffled Frog Leaping Algorithm

The difficulties associated with using mathematical optimization on large-scale engineering problems have contributed to the development of alternative solutions. Linear programming and dynamic programming techniques, for example, often fail (or reach local optimum) in solving NP-hard problems with large number of variables and non-linear objective functions. To overcome these problems, researchers have proposed evolutionary-based algorithms for searching near-optimum solutions to problems. Evolutionary algorithms (EAs) are stochastic search methods that mimic the metaphor of natural biological evolution and/or the social behaviour of species. Examples include how ants find the shortest route to a source of food and how birds find their destination during migration. The behaviour of such species is guided by learning, adaptation, and evolution. To mimic the efficient behaviour of these species, various researchers have developed computational systems that seek fast and robust solutions to complex optimization problems. The first evolutionary-based technique introduced in the literature was the genetic algorithms (Gas). GAs were developed based on the Darwinian principle of the ‘survival of the fittest’ and the natural process of evolution through reproduction. Based on its demonstrated ability to reach near-optimum solutions to large problems, the GAs technique has been used in many applications in science and engineering. Despite their benefits, GAs may require long processing time for a near optimum solution to evolve. Also, not all problems lend themselves well to a solution with GAs.

Uploaded by

Uday Wankar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

OPTIMIZATION-Shuffled Frog

Leaping Algorithm
What is optimization....?
Its a procedure to make a system or
design more effective, especially
involving the mathematical techniques.

To minimize the cost of production or


to maximize the efficiency of
production.
Its a technique to:
Find Best Solution
Minimal Cost
Minimal Error
Maximal Profit
Maximal Utility

Optimization problems are solved by using


rigorous or approximate mathematical search
techniques.
Methods of Optimization
Mathematical optimization
1) Linear Programming
2) Dynamic Programming

Evolutionary algorithms- That mimic


the metaphor of natural biological
evolution and the social behaviour of
species.
Types of Evolutionary algorithms
Genetic algorithms - Survival of the
genetically fittest
Memetic algorithms- Survival of the
genetically fittest and most experienced
Particle swarm- Flock migration
Ant colony- Shortest path to food
source
Shuffled frog leaping- Group search of frogs
for food
Types.......
What is shuffled
frog leaping
algorithm...?

The SFLA is a method which is based on observing,


imitating, and modelling the behaviour of a group of
frogs when searching for the location that has the
maximum amount of available food .

Oh...! Simple..They are


just observing our food
searching nature.
Process of SFLA

Population consists of a set of frogs


Partitioned into subsets referred to as memeplexes
Each memeplexes performing a local search
After a defined number of evolution steps, ideas
are passed among memeplexes in a shuffling
process
The local search and the shuffling processes
continue until defined convergence criteria are
satisfied
Analytical Process

1. Population of P frogs is created randomly


2. A frog i is represented as xi (xi1, xi2,., Xi)
3. Sorted in a descending order according to
their fitness.
4. Population is divided into m memeplexes,
each containing n frogs.
P=m n
5. Frogs with the best and the worst fitnesse
are identified as xb and xw
Change in frog position (Di) = rand( ) (Xb-Xw)
Previous position Xw
New position= Xw + Di;

If no improvement becomes possible in this case,


then a new solution is randomly generated to
replace that frog.
The calculations then continue for a specific
number of iterations.
Application of SFLA

Ac-dc optimal power flow


Scheduling of construction projects
Computer-aided design activities
Water distribution network design
Comparison among different
Evolutionary Algorithms
CONCLUSION

SFLA has been used as appropriate tools to


obtain the best solutions with the least total
time and cost by evaluating unlimited possible
options.

Implementation of evolutionary algorithms in


various field because of their reliability and
simple implementation
REFRENCES
Eusuff M. M., Lansey K.E. ,Shuffled Frog
Leaping Algorithm: A Memetic Metaheuristic
for Discrete Optimization, J. Eng.
Optimization, 2006.
Eusuff, M.M. and Lansey, K.E., Optimization
using shuffled frog leaping algorithm. , 2003
Elbeltag , T. and Grierson Comparison among
five evolutionary-based optimization
algorithms. J. Adv. Engg. Informatics, 2005.
THANK YOU

You might also like