Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization

Muzaffar Eusuff, Kevin E Lansey, Fayzul Pasha

Research output: Contribution to journalArticle

569 Citations (Scopus)

Abstract

A memetic meta-heuristic called the shuffled frog-leaping algorithm (SFLA) has been developed for solving combinatorial optimization problems. The SFLA is a population-based cooperative search metaphor inspired by natural memetics. The algorithm contains elements of local search and global information exchange. The SFLA consists of a set of interacting virtual population of frogs partitioned into different memeplexes. The virtual frogs act as hosts or carriers of memes where a meme is a unit of cultural evolution. The algorithm performs simultaneously an independent local search in each memeplex. The local search is completed using a particle swarm optimization-like method adapted for discrete problems but emphasizing a local search. To ensure global exploration, the virtual frogs are periodically shuffled and reorganized into new memplexes in a technique similar to that used in the shuffled complex evolution algorithm. In addition, to provide the opportunity for random generation of improved information, random virtual frogs are generated and substituted in the population.The algorithm has been tested on several test functions that present difficulties common to many global optimization problems. The effectiveness and suitability of this algorithm have also been demonstrated by applying it to a groundwater model calibration problem and a water distribution system design problem. Compared with a genetic algorithm, the experimental results in terms of the likelihood of convergence to a global optimal solution and the solution speed suggest that the SFLA can be an effective tool for solving combinatorial optimization problems.

Original languageEnglish (US)
Pages (from-to)129-154
Number of pages26
JournalEngineering Optimization
Volume38
Issue number2
DOIs
StatePublished - Mar 2006

Fingerprint

Discrete Optimization
Metaheuristics
Local Search
Combinatorial optimization
Combinatorial Optimization Problem
Cultural Evolution
Water Distribution Systems
Random Generation
Water distribution systems
Model Calibration
Ground Water
Global optimization
Test function
Global Optimization
Particle swarm optimization (PSO)
Particle Swarm Optimization
System Design
Groundwater
Likelihood
Optimal Solution

Keywords

  • Combinatorial optimization
  • Genes
  • Memes
  • Memetic algorithm
  • Meta-heuristic
  • Shuffled frog-leaping algorithm

ASJC Scopus subject areas

  • Engineering (miscellaneous)
  • Management Science and Operations Research

Cite this

Shuffled frog-leaping algorithm : A memetic meta-heuristic for discrete optimization. / Eusuff, Muzaffar; Lansey, Kevin E; Pasha, Fayzul.

In: Engineering Optimization, Vol. 38, No. 2, 03.2006, p. 129-154.

Research output: Contribution to journalArticle

@article{37a87fd6bfc54641865341bb53ac0d9e,
title = "Shuffled frog-leaping algorithm: A memetic meta-heuristic for discrete optimization",
abstract = "A memetic meta-heuristic called the shuffled frog-leaping algorithm (SFLA) has been developed for solving combinatorial optimization problems. The SFLA is a population-based cooperative search metaphor inspired by natural memetics. The algorithm contains elements of local search and global information exchange. The SFLA consists of a set of interacting virtual population of frogs partitioned into different memeplexes. The virtual frogs act as hosts or carriers of memes where a meme is a unit of cultural evolution. The algorithm performs simultaneously an independent local search in each memeplex. The local search is completed using a particle swarm optimization-like method adapted for discrete problems but emphasizing a local search. To ensure global exploration, the virtual frogs are periodically shuffled and reorganized into new memplexes in a technique similar to that used in the shuffled complex evolution algorithm. In addition, to provide the opportunity for random generation of improved information, random virtual frogs are generated and substituted in the population.The algorithm has been tested on several test functions that present difficulties common to many global optimization problems. The effectiveness and suitability of this algorithm have also been demonstrated by applying it to a groundwater model calibration problem and a water distribution system design problem. Compared with a genetic algorithm, the experimental results in terms of the likelihood of convergence to a global optimal solution and the solution speed suggest that the SFLA can be an effective tool for solving combinatorial optimization problems.",
keywords = "Combinatorial optimization, Genes, Memes, Memetic algorithm, Meta-heuristic, Shuffled frog-leaping algorithm",
author = "Muzaffar Eusuff and Lansey, {Kevin E} and Fayzul Pasha",
year = "2006",
month = "3",
doi = "10.1080/03052150500384759",
language = "English (US)",
volume = "38",
pages = "129--154",
journal = "Engineering Optimization",
issn = "0305-215X",
publisher = "Taylor and Francis Ltd.",
number = "2",

}

TY - JOUR

T1 - Shuffled frog-leaping algorithm

T2 - A memetic meta-heuristic for discrete optimization

AU - Eusuff, Muzaffar

AU - Lansey, Kevin E

AU - Pasha, Fayzul

PY - 2006/3

Y1 - 2006/3

N2 - A memetic meta-heuristic called the shuffled frog-leaping algorithm (SFLA) has been developed for solving combinatorial optimization problems. The SFLA is a population-based cooperative search metaphor inspired by natural memetics. The algorithm contains elements of local search and global information exchange. The SFLA consists of a set of interacting virtual population of frogs partitioned into different memeplexes. The virtual frogs act as hosts or carriers of memes where a meme is a unit of cultural evolution. The algorithm performs simultaneously an independent local search in each memeplex. The local search is completed using a particle swarm optimization-like method adapted for discrete problems but emphasizing a local search. To ensure global exploration, the virtual frogs are periodically shuffled and reorganized into new memplexes in a technique similar to that used in the shuffled complex evolution algorithm. In addition, to provide the opportunity for random generation of improved information, random virtual frogs are generated and substituted in the population.The algorithm has been tested on several test functions that present difficulties common to many global optimization problems. The effectiveness and suitability of this algorithm have also been demonstrated by applying it to a groundwater model calibration problem and a water distribution system design problem. Compared with a genetic algorithm, the experimental results in terms of the likelihood of convergence to a global optimal solution and the solution speed suggest that the SFLA can be an effective tool for solving combinatorial optimization problems.

AB - A memetic meta-heuristic called the shuffled frog-leaping algorithm (SFLA) has been developed for solving combinatorial optimization problems. The SFLA is a population-based cooperative search metaphor inspired by natural memetics. The algorithm contains elements of local search and global information exchange. The SFLA consists of a set of interacting virtual population of frogs partitioned into different memeplexes. The virtual frogs act as hosts or carriers of memes where a meme is a unit of cultural evolution. The algorithm performs simultaneously an independent local search in each memeplex. The local search is completed using a particle swarm optimization-like method adapted for discrete problems but emphasizing a local search. To ensure global exploration, the virtual frogs are periodically shuffled and reorganized into new memplexes in a technique similar to that used in the shuffled complex evolution algorithm. In addition, to provide the opportunity for random generation of improved information, random virtual frogs are generated and substituted in the population.The algorithm has been tested on several test functions that present difficulties common to many global optimization problems. The effectiveness and suitability of this algorithm have also been demonstrated by applying it to a groundwater model calibration problem and a water distribution system design problem. Compared with a genetic algorithm, the experimental results in terms of the likelihood of convergence to a global optimal solution and the solution speed suggest that the SFLA can be an effective tool for solving combinatorial optimization problems.

KW - Combinatorial optimization

KW - Genes

KW - Memes

KW - Memetic algorithm

KW - Meta-heuristic

KW - Shuffled frog-leaping algorithm

UR - http://www.scopus.com/inward/record.url?scp=33244474874&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33244474874&partnerID=8YFLogxK

U2 - 10.1080/03052150500384759

DO - 10.1080/03052150500384759

M3 - Article

AN - SCOPUS:33244474874

VL - 38

SP - 129

EP - 154

JO - Engineering Optimization

JF - Engineering Optimization

SN - 0305-215X

IS - 2

ER -