Comparison of algorithms for the optimal location of control valves for leakage reduction in WDNs

19Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

Abstract

The paper presents the comparison of two different algorithms for the optimal location of control valves for leakage reduction in water distribution networks (WDNs). The former is based on the sequential addition (SA) of control valves. At the generic step Nval of SA, the search for the optimal combination of Nval valves is carried out, while containing the optimal combination of Nval - 1 valves found at the previous step. Therefore, only one new valve location is searched for at each step of SA, among all the remaining available locations. The latter algorithm consists of a multi-objective genetic algorithm (GA), in which valve locations are encoded inside individual genes. For the sake of consistency, the same embedded algorithm, based on iterated linear programming (LP), was used inside SA and GA, to search for the optimal valve settings at various time slots in the day. The results of applications to two WDNs show that SA and GA yield identical results for small values of Nval. When this number grows, the limitations of SA, related to its reduced exploration of the research space, emerge. In fact, for higher values of Nval, SA tends to produce less beneficial valve locations in terms of leakage abatement. However, the smaller computation time of SA may make this algorithm preferable in the case of large WDNs, for which the application of GA would be overly burdensome.

Author supplied keywords

Cite

CITATION STYLE

APA

Creaco, E., & Pezzinga, G. (2018). Comparison of algorithms for the optimal location of control valves for leakage reduction in WDNs. Water (Switzerland), 10(4). https://doi.org/10.3390/w10040466

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