Scatter search heuristic for least-cost design of water distribution networks

Scatter search heuristic for least-cost design of water distribution networks

0.00 Avg rating0 Votes
Article ID: iaor20083289
Country: United Kingdom
Volume: 39
Issue: 7
Start Page Number: 857
End Page Number: 876
Publication Date: Oct 2007
Journal: Engineering Optimization
Authors: , , ,
Keywords: heuristics: genetic algorithms, optimization
Abstract:

The optimization problems of water distribution networks are complex, multi-modal and discrete-variable problems that cannot be easily solved with conventional optimization algorithms. Heuristic algorithms such as genetic algorithms, simulated annealing, tabu search and ant colony optimization have been extensively employed over the last decade. This article proposed an optimization procedure based on the scatter search (SS) framework, which is also a heuristic algorithm, to obtain the least-cost designs of three well-known looped water distribution networks (two-loop, Hanoi and New York networks). The computational results obtained with the three benchmark instances indicate that SS is able to find solutions comparable to those provided by some of the most competitive algorithms published in the literature.

Reviews

Required fields are marked *. Your email address will not be published.