An iterated local search algorithm for multi-period water distribution network design optimization

9Citations
Citations of this article
24Readers
Mendeley users who have this article in their library.

Abstract

Water 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.

Cite

CITATION STYLE

APA

De Corte, A., & Sörensen, K. (2016). An iterated local search algorithm for multi-period water distribution network design optimization. Water (Switzerland), 8(8). https://doi.org/10.3390/w8080359

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free