Application of evolutionary computing on least-cost water distribution network designs

The optimization of water distribution networks are complex, multi-modal and discrete-variable problems that cannot be easily solved with conventional optimization algorithms. This study adopts ant algorithm (AA), immune algorithm (IA), and scatter search (SS) which are all evolutionary computing techniques to avoid the entrapments by local optimal solutions, to obtain the leastcost designs of water distribution networks. One benchmark water distribution network optimization problems is used as a case study. Comparisons of the results of this study with relevant literature data indicate that AA and SS are able to find solutions better than those provided by some of the most competitive algorithms published in the literature. Furthermore, the results of the success rate evaluation indicate that AA can 100% successfully achieve the global optimum.

[1]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[2]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[3]  Dragan Savic,et al.  Genetic Algorithms for Least-Cost Design of Water Distribution Networks , 1997 .

[4]  E. Downey Brill,et al.  Optimization of Looped Water Distribution Systems , 1981 .

[5]  Peter Greistorfer,et al.  A Tabu Scatter Search Metaheuristic for the Arc Routing Problem , 2002 .

[6]  Jonathan Timmis,et al.  Artificial immune systems as a novel soft computing paradigm , 2003, Soft Comput..

[7]  Angus R. Simpson,et al.  Ant Colony Optimization for Design of Water Distribution Systems , 2003 .

[8]  Belén Melián-Batista,et al.  Parallelization of the scatter search for the p-median problem , 2003, Parallel Comput..

[9]  Xiaoyu Song,et al.  BDD minimization by scatter search , 2002, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Hironori Hirata,et al.  An immunity based genetic algorithm and its application to the VLSI floorplan design problem , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[11]  D. B. Khang,et al.  A two‐phase decomposition method for optimal design of looped water distribution networks , 1990 .

[12]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[13]  Pramod R. Bhave,et al.  Optimal Expansion of Water Distribution Systems , 1985 .

[14]  Kevin E Lansey,et al.  Optimization of Water Distribution Network Design Using the Shuffled Frog Leaping Algorithm , 2003 .

[15]  Maria da Conceição Cunha,et al.  Water Distribution Network Design Optimization: Simulated Annealing Approach , 1999 .

[16]  Uri Shamir,et al.  Water Distribution Systems Analysis , 1968 .

[17]  Yu-Hsin Liu.  A hybrid scatter search for the probabilistic traveling salesman problem , 2007, Comput. Oper. Res..

[18]  Fred W. Glover,et al.  A Template for Scatter Search and Path Relinking , 1997, Artificial Evolution.