Self-Adaptive Solution-Space Reduction Algorithm for Multi-Objective Evolutionary Design Optimization of Water Distribution Networks

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

This article is free to access.

Abstract

An effective way to improve the computational efficiency of evolutionary algorithms is to make the solution space of the optimization problem under consideration smaller. A new reliability-based algorithm that does this was developed for water distribution networks. The objectives considered in the formulation of the optimization problem were minimization of the initial construction cost and maximization of the flow entropy as a resilience surrogate. After achieving feasible solutions, the active solution space of the optimization problem was re-set for each pipe in each generation until the end of the optimization. The algorithm re-sets the active solution space by reducing the number of pipe diameter options for each pipe, based on the most likely flow distribution. The main components of the methodology include an optimizer, a hydraulic simulator and an algorithm that calculates the flow entropy for any given network configuration. The methodology developed is generic and self-adaptive, and prior setting of the reduced solution space is not required. A benchmark network in the literature was investigated, and the results showed that the algorithm improved the computational efficiency and quality of the solutions achieved by a considerable margin.

Cite

CITATION STYLE

APA

Tanyimboh, T. T., & Czajkowska, A. (2018). Self-Adaptive Solution-Space Reduction Algorithm for Multi-Objective Evolutionary Design Optimization of Water Distribution Networks. Water Resources Management, 32(10), 3337–3352. https://doi.org/10.1007/s11269-018-1994-5

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