An Improved Genetic Algorithm for Pipe Network Optimization

An improved genetic algorithm (GA) formulation for pipe network optimization has been developed. The new GA uses variable power scaling of the fitness function. The exponent introduced into the fitness function is increased in magnitude as the GA computer run proceeds. In addition to the more commonly used bitwise mutation operator, an adjacency or creeping mutation operator is introduced. Finally, Gray codes rather than binary codes are used to represent the set of decision variables which make up the pipe network design. Results are presented comparing the performance of the traditional or simple GA formulation and the improved GA formulation for the New York City tunnels problem. The case study results indicate the improved GA performs significantly better than the simple GA. In addition, the improved GA performs better than previously used traditional optimization methods such as linear, dynamic, and nonlinear programming methods and an enumerative search method. The improved GA found a solution for the New York tunnels problem which is the lowest-cost feasible discrete size solution yet presented in the literature

Pressure-dependent EPANET extension

In water distribution systems (WDSs), the available flow at a demand node is dependent on the pressure at that node. When a network is lacking in pressure, not all consumer demands will be met in full. In this context, the assumption that all demands are fully satisfied regardless of the pressure in the system becomes unreasonable and represents the main limitation of the conventional demand driven analysis (DDA) approach to WDS modelling. A realistic depiction of the network performance can only be attained by considering demands to be pressure dependent. This paper presents an extension of the renowned DDA based hydraulic simulator EPANET 2 to incorporate pressure-dependent demands. This extension is termed “EPANET-PDX” (pressure-dependent extension) herein. The utilization of a continuous nodal pressure-flow function coupled with a line search and backtracking procedure greatly enhance the algorithm’s convergence rate and robustness. Simulations of real life networks consisting of multiple sources, pipes, valves and pumps were successfully executed and results are presented herein. Excellent modelling performance was achieved for analysing both normal and pressure deficient conditions of the WDSs. Detailed computational efficiency results of EPANET-PDX with reference to EPANET 2 are included as well

GALAXY: A new hybrid MOEA for the Optimal Design of Water Distribution Systems

This is the final version of the article. Available from American Geophysical Union via the DOI in this record.The first author would like to appreciate the financial support given by both the University of Exeter and the China Scholarship Council (CSC) toward the PhD research. We also appreciate the three anonymous reviewers, who help improve the quality of this paper substantially. The source code of the latest versions of NSGA-II and ε-MOEA can be downloaded from the official website of Kanpur Genetic Algorithms Laboratory via http://www.iitk.ac.in/kangal/codes.shtml. The description of each benchmark problem used in this paper, including the input file of EPANET and the associated best-known Pareto front, can be accessed from the following link to the Centre for Water Systems (http://tinyurl.com/cwsbenchmarks/). GALAXY can be accessed via http://tinyurl.com/cws-galaxy

Efficiency of evolutionary algorithms in water network pipe sizing

The pipe sizing of water networks via evolutionary algorithms is of great interest because it allows the selection of alternative economical solutions that meet a set of design requirements. However, available evolutionary methods are numerous, and methodologies to compare the performance of these methods beyond obtaining a minimal solution for a given problem are currently lacking. A methodology to compare algorithms based on an efficiency rate (E) is presented here and applied to the pipe-sizing problem of four medium-sized benchmark networks (Hanoi, New York Tunnel, GoYang and R-9 Joao Pessoa). E numerically determines the performance of a given algorithm while also considering the quality of the obtained solution and the required computational effort. From the wide range of available evolutionary algorithms, four algorithms were selected to implement the methodology: a PseudoGenetic Algorithm (PGA), Particle Swarm Optimization (PSO), a Harmony Search and a modified Shuffled Frog Leaping Algorithm (SFLA). After more than 500,000 simulations, a statistical analysis was performed based on the specific parameters each algorithm requires to operate, and finally, E was analyzed for each network and algorithm. The efficiency measure indicated that PGA is the most efficient algorithm for problems of greater complexity and that HS is the most efficient algorithm for less complex problems. However, the main contribution of this work is that the proposed efficiency ratio provides a neutral strategy to compare optimization algorithms and may be useful in the future to select the most appropriate algorithm for different types of optimization problems

Penalty-free feasibility boundary convergent multi-objective evolutionary algorithm for the optimization of water distribution systems

This paper presents a new penalty-free multi-objective evolutionary approach (PFMOEA) for the optimization of water distribution systems (WDSs). The proposed approach utilizes pressure dependent analysis (PDA) to develop a multi-objective evolutionary search. PDA is able to simulate both normal and pressure deficient networks and provides the means to accurately and rapidly identify the feasible region of the solution space, effectively locating global or near global optimal solutions along its active constraint boundary. The significant advantage of this method over previous methods is that it eliminates the need for ad-hoc penalty functions, additional “boundary search” parameters, or special constraint handling procedures. Conceptually, the approach is downright straightforward and probably the simplest hitherto. The PFMOEA has been applied to several WDS benchmarks and its performance examined. It is demonstrated that the approach is highly robust and efficient in locating optimal solutions. Superior results in terms of the initial network construction cost and number of hydraulic simulations required were obtained. The improvements are demonstrated through comparisons with previously published solutions from the literature

Informational entropy : a failure tolerance and reliability surrogate for water distribution networks

Evolutionary algorithms are used widely in optimization studies on water distribution networks. The optimization algorithms use simulation models that analyse the networks under various operating conditions. The solution process typically involves cost minimization along with reliability constraints that ensure reasonably satisfactory performance under abnormal operating conditions also. Flow entropy has been employed previously as a surrogate reliability measure. While a body of work exists for a single operating condition under steady state conditions, the effectiveness of flow entropy for systems with multiple operating conditions has received very little attention. This paper describes a multi-objective genetic algorithm that maximizes the flow entropy under multiple operating conditions for any given network. The new methodology proposed is consistent with the maximum entropy formalism that requires active consideration of all the relevant information. Furthermore, an alternative but equivalent flow entropy model that emphasizes the relative uniformity of the nodal demands is described. The flow entropy of water distribution networks under multiple operating conditions is discussed with reference to the joint entropy of multiple probability spaces, which provides the theoretical foundation for the optimization methodology proposed. Besides the rationale, results are included that show that the most robust or failure-tolerant solutions are achieved by maximizing the sum of the entropies

Solving the multi-period water distribution network design problem with a hybrid simulated anealling

This work presents an optimization technique based on Simulated Annealing (SA) to solve the Water Distribution Network Design problem, considering multi-period restrictions with time varying demand patterns. The design optimization of this kind of networks is an important issue in modern cities, since a safe, adequate, and accessible supply of potable water is one of the basic necessities of any human being. Given the complexity of this problem, the SA is improved with a local search procedure, yielding a hybrid SA, in order to obtain good quality networks designs. Additionally, four variants of this algorithm based on different cooling schemes are introduced and analyzed. A broad experimentation using different benchmark networks is carried out to test our proposals. Moreover, a comparison with an approach from the literature reveals the goodness to solve this network design problem.Fil: Bermudez, Carlos Alberto. Universidad Nacional de la Pampa. Facultad de Ingeniería; ArgentinaFil: Salto, Carolina. Universidad Nacional de la Pampa. Facultad de Ingeniería; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Patagonia Confluencia; ArgentinaFil: Minetti, Gabriela Fabiana. Universidad Nacional de la Pampa. Facultad de Ingeniería; Argentin

A combined NLP-differential evolution algorithm approach for the optimization of looped water distribution systems

This paper proposes a novel optimization approach for the least cost design of looped water distribution systems (WDSs). Three distinct steps are involved in the proposed optimization approach. In the first step, the shortest-distance tree within the looped network is identified using the Dijkstra graph theory algorithm, for which an extension is proposed to find the shortest-distance tree for multisource WDSs. In the second step, a nonlinear programming (NLP) solver is employed to optimize the pipe diameters for the shortest-distance tree (chords of the shortest-distance tree are allocated the minimum allowable pipe sizes). Finally, in the third step, the original looped water network is optimized using a differential evolution (DE) algorithm seeded with diameters in the proximity of the continuous pipe sizes obtained in step two. As such, the proposed optimization approach combines the traditional deterministic optimization technique of NLP with the emerging evolutionary algorithm DE via the proposed network decomposition. The proposed methodology has been tested on four looped WDSs with the number of decision variables ranging from 21 to 454. Results obtained show the proposed approach is able to find optimal solutions with significantly less computational effort than other optimization techniques.Feifei Zheng, Angus R. Simpson and Aaron C. Zecchi