An Iterated Local Search Algorithm for Multi-Period Water Distribution Network Design Optimization
AbstractWater distribution networks consist of different components, such as reservoirs and pipes, and exist to provide users (households, agriculture, industry) with high-quality water at adequate pressure and flow. Water distribution network design optimization aims to find optimal diameters for every pipe, chosen from a limited set of commercially available diameters. This combinatorial optimization problem has received a lot of attention over the past forty years. In this paper, the well-studied single-period problem is extended to a multi-period setting in which time varying demand patterns occur. Moreover, an additional constraint—which sets a maximum water velocity—is imposed. A metaheuristic technique called iterated local search is applied to tackle this challenging optimization problem. A full-factorial experiment is conducted to validate the added value of the algorithm components and to configure optimal parameter settings. The algorithm is tested on a broad range of 150 different (freely available) test networks. View Full-Text
Externally hosted supplementary file 1
Description: Input instances are also available online via: http://antor.uantwerpen.be/hydrogen/.
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
De Corte, A.; Sörensen, K. An Iterated Local Search Algorithm for Multi-Period Water Distribution Network Design Optimization. Water 2016, 8, 359.
De Corte A, Sörensen K. An Iterated Local Search Algorithm for Multi-Period Water Distribution Network Design Optimization. Water. 2016; 8(8):359.Chicago/Turabian Style
De Corte, Annelies; Sörensen, Kenneth. 2016. "An Iterated Local Search Algorithm for Multi-Period Water Distribution Network Design Optimization." Water 8, no. 8: 359.