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

Muzaffar M. Eusuff, Kevin E. Lansey

Research output: Contribution to journalArticlepeer-review

1329 Scopus citations


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
Issue number3
StatePublished - May 2003


  • Algorithms
  • Computer models
  • Optimization
  • Water distribution

ASJC Scopus subject areas

  • Civil and Structural Engineering
  • Geography, Planning and Development
  • Water Science and Technology
  • Management, Monitoring, Policy and Law


Dive into the research topics of 'Optimization of water distribution network design using the shuffled frog leaping algorithm'. Together they form a unique fingerprint.

Cite this