Search

A noncrossover dither creeping mutation-based genetic algorithm (CMBGA) for pipe network optimization has been developed and is analyzed in this paper. This CMBGA differs from the classic genetic algorithm (GA) optimization in that it does not utilize the crossover operator; instead, it only uses selection and a proposed dither creeping mutation operator. The creeping mutation rate in the proposed dither creeping mutation operator is randomly generated in a range throughout a GA run, rather than being set to a fixed value. In addition, the dither mutation rate is applied at an individual chromosome level rather than at the generation level. The dither creeping mutation probability is set to take values from a small range that is centered about (where = number of decision variables of the optimization problem being considered). This is motivated by the fact that a mutation probability of approximately previously has been demonstrated to be an effective value and is commonly used for the GA. Two case studies are used to investigate the effectiveness of the proposed CMBGA. An objective of this paper is to compare the performance of the proposed CMBGA with four other GA variants and other published results. The results show that the proposed CMBGA exhibits considerable improvement over the considered GA variants, and comparable performance with respect to other previously published results. Two big advantages of the CMBGA are its simplicity and the fact that it requires the tuning of fewer parameters compared with other GA variants. [ABSTRACT FROM AUTHOR]

Considerable research has been carried out on the optimization of water distribution systems (WDSs) over the last three decades. In previous research, attention has mainly focused on the minimization of cost, due to the high expenditure associated with the construction and maintenance of such systems. However, the impacts of WDSs on the environment usually have not been considered adequately. The recent increasing awareness of sustainability and climate change, especially global warming, has led to research where greenhouse gas (GHG) emissions are considered. In the study described in this paper a multiobjective genetic algorithm for WDS optimization has been used as an explorative tool to investigate the trade-offs between the traditional economic objective of minimizing costs and an additional environmental objective of minimizing GHG emissions. The impacts of minimizing GHG emissions on the results of WDS optimization have been explored for a case study in this paper. The results indicate that the inclusion of GHG emission minimization as one of the objectives results in significant trade-offs between the economic and environmental objectives. Furthermore, a sensitivity analysis has been conducted by using different discount rates in a present value analysis for computing both ongoing costs and GHG emissions. The results obtained show that the Pareto-optimal front is very sensitive to the discount rates used. As a result, the selection of discount rates has a significant impact on final decision making. [ABSTRACT FROM AUTHOR]

Cost-effective reduction of water loss is a compelling but challenging task for water utilities. This paper presents a model-based optimization method for leakage detection of water distribution systems. Leakage hotspots are assumed to exist at the model nodes identified. Leakage is represented as pressure-dependent demand simulated as emitter flows at selected model nodes. The leakage detection method is formulated to optimize the leakage node locations and their associated emitter coefficients such that the differences between the model predicted and the field observed values for pressure and flow are minimized. The optimization problem is solved by using a competent genetic algorithm. The leakage detection method is developed as an add-on feature of the optimization-based model calibration tool. This enables engineers to undertake leakage hotspot optimization as an independent task or combine the task with hydraulic model calibration, subject to suitably varied field data. Two case studies are discussed in this paper including an example from literature and a district water system in the United Kingdom. The results obtained illustrate that the optimization model for predicting leakage hotspots can be effective despite the recognized challenges of model calibration and the physical measurement limitations from the pressure and flow surveys also referred to as field tests. It is found that the method is effective at being applied for hydraulic conditions that occur in the early hours of the morning, often on water networks with excess design capacity and where hydraulic gradients are slack and loggers may sometimes be working close to their limits of accuracy. [ABSTRACT FROM AUTHOR]

The problem of deploying sensors in a large water distribution network is considered, in order to detect the malicious introduction of contaminants. It is shown that a large class of realistic objective functions—such as reduction of detection time and the population protected from consuming contaminated water—exhibits an important diminishing returns effect called submodularity. The submodularity of these objectives is exploited in order to design efficient placement algorithms with provable performance guarantees. The algorithms presented in this paper do not rely on mixed integer programming, and scale well to networks of arbitrary size. The problem instances considered in the approach presented in this paper are orders of magnitude (a factor of 72) larger than the largest problems solved in the literature. It is shown how the method presented here can be extended to multicriteria optimization, selecting placements robust to sensor failures and optimizing minimax criteria. Extensive empirical evidence on the effectiveness of the method presented in this paper on two benchmark distribution networks, and an actual drinking water distribution system of greater than 21,000 nodes, is presented. [ABSTRACT FROM AUTHOR]

This work presents a postoptimization methodology for refining the solutions found by adaptive search algorithms used in the design of large water distribution networks. The approach uses two heuristics to search for an optimal combination of pipes that, after a reduction of their diameters, will maximize cost savings while continuing to meet design constraints. Adaptive search methods are often used to design urban water distribution networks when the number of pipes in the network is insignificant. For complex, real-world networks, however, such methods are computationally demanding, and they have difficulty finding near-global optima. To identify a solution as close to the global optimum (and in which no pipe can be reduced without violating pressure constraint), requires a high-speed computer potentially running for a long time and also probably some good fortune. The postoptimization approach presented in this paper is shown to be an efficient complement to heuristic search algorithms used in the design of real-world networks. In a network created with the aid of a genetic algorithm, the proposed heuristics found that 4.37% of the pipes with a diameter greater than the minimum could be further reduced without causing hydraulic failure. [ABSTRACT FROM AUTHOR]

The suitability of genetic algorithms (GAs) for the optimization of water distribution systems (WDSs) has been demonstrated extensively. However, despite many years of application in many different fields, the selection of the GA parameters remains a difficult and time consuming task. In this paper, two methodologies that do not require trial-and-error GA parameter calibration have been tested on a WDS optimization problem to determine their suitability for application in the water resources field and to assess their ability in locating near-optimal solutions. The results indicate that both approaches located solutions that were significantly better than a GA using typical parameter values, while the methodology based on convergence of the GA population located the best solutions overall. This method can be easily applied to assist GA users in identifying suitable GA parameters without requiring a time consuming trial-and-error approach. [ABSTRACT FROM AUTHOR]

The paper presents a method for the design of water distribution networks with various network elements such as pipes, pumps, and tanks. A steady-state genetic algorithm is used to solve the proposed single objective model. Minimization of total cost, which includes capital cost and energy cost, is considered as the objective. A new approach for tank sizing is proposed, which does not require explicit consideration of some of the operational constraints, such as the limits on maximum and minimum tank levels. Unlike other methods, the one proposed here conducts extended period simulation for every trial solution in the optimization process. To demonstrate the efficacy of the model, a well-known design example, namely the “Anytown” water distribution network is solved. Designs obtained, using the present method, are cheaper than those proposed by other researchers under similar performance conditions but with different tank sizing methods. Comparison of the results obtained with those published in the literature shows the advantage of using the proposed model in obtaining optimal/near optimal solutions. [ABSTRACT FROM AUTHOR]

Contamination emergency in water distribution systems is a complex situation where optimal operation becomes important for public health. In case of emergency corrective operational actions for flushing the pollutant out of the network are needed, which have to be fast and accurate. Under such a stressful situation, trial-and-error simulation experiments with the hydrodynamic and water quality models cannot be applied since significant number of model evaluations may be required to identify the optimal solution. This paper presents a methodology for finding sets of operational interventions in a supply network for flushing a contaminant by minimizing the impact on the population. The situation is treated as both single- and multiobjective optimization problem, which is solved by using evolutionary optimization approaches, in combination with the EPANET solver engine. The methodology is tested on a simple imaginary network configuration, as well as on a real case study for the city of Villavicencio in Colombia. The results prove the usefulness of the approach for advising the operators and decision makers. [ABSTRACT FROM AUTHOR]

Water distribution systems (WDSs) are costly infrastructure, and much attention has been given to the application of optimization methods to minimize design costs. In previous studies, ant colony optimization (ACO) has been found to perform extremely competitively for WDS optimization. In this paper, five ACO algorithms are tested: one basic algorithm (ant system) and four more advanced algorithms [ant colony system, elitist ant system, elitist-rank ant system (ASrank), and max-min ant system (MMAS)]. Experiments are carried out to determine their performance on four WDS case studies, three of which have been considered widely in the literature. The findings of the study show that some ACO algorithms are very successful for WDS design, as two of the ACO algorithms (MMAS and ASrank) outperform all other algorithms applied to these case studies in the literature. [ABSTRACT FROM AUTHOR]