Optimization of water distribution network design using the shuffled frog leaping algorithm

Muzaffar M. Eusuff, Kevin E Lansey

Research output: Contribution to journalArticle

964 Citations (Scopus)

Abstract

Shuffled Frog Leaping Algorithm (SFLA) is a meta-heuristic for solving discrete optimization problems. Here it is applied to determine optimal discrete pipe sizes for new pipe networks and for network expansions. SFLA is a population based, cooperative search metaphor inspired by natural memetics. The algorithm uses memetic evolution in the form of infection of ideas from one individual to another in a local search. The local search is similar in concept to particle swarm optimization. A shuffling strategy allows for the exchange of information between local searches to move toward a global optimum. This paper summarizes the development of SFLANET, a computer model that links SFLA and the hydraulic simulation software EPANET and its library functions. Application of SFLANET to literature network design problems is then described. Although the algorithm is in its initial stages of development, promising results were obtained.

Original languageEnglish (US)
Pages (from-to)210-225
Number of pages16
JournalJournal of Water Resources Planning and Management
Volume129
Issue number3
DOIs
StatePublished - May 2003

Fingerprint

network design
Electric power distribution
frog
water
Water
pipe
Pipe
heuristics
Particle swarm optimization (PSO)
metaphor
Hydraulics
distribution
hydraulics
software
simulation

Keywords

  • Algorithms
  • Computer models
  • Optimization
  • Water distribution

ASJC Scopus subject areas

  • Water Science and Technology
  • Civil and Structural Engineering

Cite this

Optimization of water distribution network design using the shuffled frog leaping algorithm. / Eusuff, Muzaffar M.; Lansey, Kevin E.

In: Journal of Water Resources Planning and Management, Vol. 129, No. 3, 05.2003, p. 210-225.

Research output: Contribution to journalArticle

@article{5fa7243af8bf4eb58a9a0141c9e8a299,
title = "Optimization of water distribution network design using the shuffled frog leaping algorithm",
abstract = "Shuffled Frog Leaping Algorithm (SFLA) is a meta-heuristic for solving discrete optimization problems. Here it is applied to determine optimal discrete pipe sizes for new pipe networks and for network expansions. SFLA is a population based, cooperative search metaphor inspired by natural memetics. The algorithm uses memetic evolution in the form of infection of ideas from one individual to another in a local search. The local search is similar in concept to particle swarm optimization. A shuffling strategy allows for the exchange of information between local searches to move toward a global optimum. This paper summarizes the development of SFLANET, a computer model that links SFLA and the hydraulic simulation software EPANET and its library functions. Application of SFLANET to literature network design problems is then described. Although the algorithm is in its initial stages of development, promising results were obtained.",
keywords = "Algorithms, Computer models, Optimization, Water distribution",
author = "Eusuff, {Muzaffar M.} and Lansey, {Kevin E}",
year = "2003",
month = "5",
doi = "10.1061/(ASCE)0733-9496(2003)129:3(210)",
language = "English (US)",
volume = "129",
pages = "210--225",
journal = "Journal of Water Resources Planning and Management - ASCE",
issn = "0733-9496",
publisher = "American Society of Civil Engineers (ASCE)",
number = "3",

}

TY - JOUR

T1 - Optimization of water distribution network design using the shuffled frog leaping algorithm

AU - Eusuff, Muzaffar M.

AU - Lansey, Kevin E

PY - 2003/5

Y1 - 2003/5

N2 - Shuffled Frog Leaping Algorithm (SFLA) is a meta-heuristic for solving discrete optimization problems. Here it is applied to determine optimal discrete pipe sizes for new pipe networks and for network expansions. SFLA is a population based, cooperative search metaphor inspired by natural memetics. The algorithm uses memetic evolution in the form of infection of ideas from one individual to another in a local search. The local search is similar in concept to particle swarm optimization. A shuffling strategy allows for the exchange of information between local searches to move toward a global optimum. This paper summarizes the development of SFLANET, a computer model that links SFLA and the hydraulic simulation software EPANET and its library functions. Application of SFLANET to literature network design problems is then described. Although the algorithm is in its initial stages of development, promising results were obtained.

AB - Shuffled Frog Leaping Algorithm (SFLA) is a meta-heuristic for solving discrete optimization problems. Here it is applied to determine optimal discrete pipe sizes for new pipe networks and for network expansions. SFLA is a population based, cooperative search metaphor inspired by natural memetics. The algorithm uses memetic evolution in the form of infection of ideas from one individual to another in a local search. The local search is similar in concept to particle swarm optimization. A shuffling strategy allows for the exchange of information between local searches to move toward a global optimum. This paper summarizes the development of SFLANET, a computer model that links SFLA and the hydraulic simulation software EPANET and its library functions. Application of SFLANET to literature network design problems is then described. Although the algorithm is in its initial stages of development, promising results were obtained.

KW - Algorithms

KW - Computer models

KW - Optimization

KW - Water distribution

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

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

U2 - 10.1061/(ASCE)0733-9496(2003)129:3(210)

DO - 10.1061/(ASCE)0733-9496(2003)129:3(210)

M3 - Article

AN - SCOPUS:0038363680

VL - 129

SP - 210

EP - 225

JO - Journal of Water Resources Planning and Management - ASCE

JF - Journal of Water Resources Planning and Management - ASCE

SN - 0733-9496

IS - 3

ER -