Search

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]

The design of a water distribution network (WDN) is conceptually a multiobjective problem characterized by stringent constraints. Even in its most simple formulation, which requires only the maintenance of minimum pressures, it is difficult to solve, and the simplifications introduced often impair the practicality of the solutions. The paper aims at integrating an engineering approach to the optimization problem by generating pseudofronts in the hydraulically feasible region of the search space. The optimization algorithms provide an entirely feasible trade-off between cost and considered constraints, which may be directly used by a hypothetical decision maker. This engineering approach requires a fast tool to search for feasible solutions: the recently developed genetic heritage by stochastic evolution transmission (GHEST) algorithm, used herein, has proved to be effective and efficient in solving the optimal design problem of WDNs. Tests are carried out on two large-size water distribution networks (Balerma and Modena), using the GHEST algorithm, modified to account for several objectives. [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 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]

Water distribution network that includes supply reservoirs, overhead tanks, consumer demand nodes, interconnecting pipes, lifting pumps, and control valves is the main mode of water supply for majority of the communities especially in urban areas. Supply of required quantity of water and at right time is the primary objective of water distribution network analysis. The analysis of water distribution networks can be broadly classified into design and operation problems and both problems have been the focus of many researchers over the past three decades. In the water distribution network design problems, the target is attaining the cost effective configuration that satisfies the minimum hydraulic head requirement at the demand nodes. In this paper, a new algorithm for design of water distribution network namely “heuristics-based algorithm” which completely utilizes the implicit information associated with the water distribution network to be designed has been proposed and validated with two water distribution networks. It is found that the proposed algorithm performs well for the least-cost design of water distribution networks. [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]

A method for near-optimal real-time on-line operation of urban water distribution system is presented and demonstrated. It uses a reduced model (RM) of the network which reproduces its performance over time with high fidelity with optimization by a genetic algorithm (GA). The RM-GA software uses network data, forecasted demands for an operational planning time-horizon (24 h ahead), field data from a SCADA on the current status of the network, time-of-day energy cost data, and operator-imposed constraints on tank water levels and demand junctions pressures. The GA looks for the near-least-cost operation plan for the whole time horizon, using the reduced network model, and activates the first hour of the plan through the SCADA. At the end of the hour, the status of the network is updated from field data, the time horizon is rolled ahead by 1 h, and the process repeated. The software was developed for and demonstrated on the distribution system of Haifa. Experiments were conducted, in which the operation which simulates the operators' set-point operation is compared with that obtained by the RM-GA, and energy cost savings of 8 and 10% were calculated for a summer and winter month, respectively. [ABSTRACT FROM AUTHOR]

A sequential irrigation schedule that honors user demands of duration and minimizes earliness and tardiness is interpreted as a single-machine schedule with earliness and tardiness costs and a common deadline (or fixed interval). A heuristic solution is presented for this irrigation scheduling problem. Four models are presented to reflect the different methods in which an irrigation system at the tertiary unit level may be operated, the first model permits jobs to be noncontiguous, i.e., idle time between jobs is permitted, whereas the others permit contiguous jobs only. The heuristic is tested extensively and the solution quality is compared with either an optimum solution from an integer program or the best available solution obtained from an integer program within allocated computation time. The heuristic is computationally efficient for all models presented, however for schedules with noncontiguous jobs, or where idle time is inserted before and after a contiguous set of jobs, solution quality deteriorates. The work brings the science of single scheduling from operations research into irrigation scheduling and suggests areas for further development. [ABSTRACT FROM AUTHOR]

Evolutionary algorithms (EAs) have been used extensively to find globally optimal solutions for water distribution system (WDS) optimization problems. However, as these algorithms are being applied to increasingly complex systems, computational efficiency is becoming an issue, and hence approaches that enable near-optimal solutions to be identified within reasonable computational budgets have received increasing attention. One of these approaches is the initialization of EAs in a manner that accounts for domain knowledge of WDS design problems. Although the effectiveness of these initialization approaches has been studied previously, the impact of algorithm searching behavior on the speed with which near-optimal solutions can be found has not yet been examined. To this end, this study aims to investigate the relative impact of different algorithm initialization methods and searching mechanisms on the speed with which near-optimal solutions can be identified for large WDS optimization problems. Fitness function and run-time behavioral statistics are used for this purpose. The results show that both the starting population and algorithm searching mechanism have an impact on the speed with which near-optimal solutions are identified. The fitness function and run-time behavioral statistics indicate that EA parameterizations that favor exploitation over exploration enable near-optimal solutions to be identified earlier in the search, which is due to the "big bowl" shape of the fitness function for all of the WDS problems considered. Using initial populations that are informed by domain knowledge further increases the speed with which near-optimal solutions can be identified. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) algorithms have been successfully used to handle a wide range of water resource optimization problems in recent years. The relative performance of various DE variants has been typically assessed based on the quality of the final solutions for the selected problems within the given computational budget. Such a comparative analysis, however, provides limited under- standing on how various operational mechanisms alter the DE algorithms' searching behavior and what searching properties lead to improved performance. To improve research in this area, this study aims to characterize and compare the searching behavior of four DE variants using a range of measure metrics, mainly focusing on real-time statistics of the algorithm's search quality, search progress, and convergence manner. The utility of the metrics is demonstrated using the four DE variants (SDE, dDE, MdDE, and SADE) applied to three water distribution network (WDN) design problems with significantly increased complexity (scales). The behavioral results offer an appreciably improved understanding of the searching characteristics associated with each DE variant, thereby providing guidance for choosing the most suitable DE algorithm to solve a particular WDN optimization problem as well as offering knowledge to develop new advanced algorithms. For real- world problems, the SDE algorithm is more suitable if a limited computational budget is allowed, whereas the SADE and MdDE variants are respectively more appealing when moderate and large computational budgets are available. A new solution with a cost of $12.62 million for the large-scale problem (1,278 decision variables) is presented. [ABSTRACT FROM AUTHOR]

This study introduces a new search method for box-constrained optimization problems called the search method for box optimization (SMBO). SMBO is a population heuristic-based search methodology that solves global optimization problems. SMBO represents the population as a probability density function (PDF) inside the problem bounds. The PDF shape is dynamically adapted during the process to guide to a 'good' search domain. The applicability and the efficiency of the method are demonstrated using two benchmark sets, which include unimodal, multimodal, expanded, and hybrid composition functions. The performance of SMBO is compared with several genetic algorithms (GAs); the first benchmark compares it with nine codes of traditional/classic GAs, and the second compares SMBO with two recent variants of genetic algorithms. The results show that SMBO performs as well as or better than the GAs in both comparisons. The method is demonstrated on a nonlinear model for management of a water supply system (WSS), and the results are compared with the commercial GA toolbox of matrix laboratory (MATLAB). [ABSTRACT FROM AUTHOR]

In recent years, drinking water distribution systems security has become a major concern. To protect public health and minimize the effected community by a contaminant intrusion, water quality needs to be continuously monitored and analyzed. Contamination warning systems are being designed to detect and characterize contaminant intrusions into water distribution systems. Since contamination injections can occur at any node at any time the theoretical number of possible injection events, even for a medium-size network, is huge and grows substantially with system size. As a result of that contamination warning systems are designed based on a subset of contamination events, which is not necessarily the most critical. To cope with this difficulty a method derived from cross entropy, which originates from rare event simulations, is proposed. The suggested algorithm is able to sample efficiently a rare subset (i.e., a subset of events with a small probability to occur, but with an extreme impact) of the entire set of possible contamination events. The suggested methodology is demonstrated using an illustrative example and two water distribution systems example applications. [ABSTRACT FROM AUTHOR]

The goal of calibrating a water distribution model is to establish a numerical model that represents the real system. Given the uncertainty in field data, recent studies have examined model parameter and predictive uncertainties and how those uncertainties can guide future data collection experiments. However, a model is to be used in some decision making process and those decisions can be influenced by the model uncertainty. Therefore, a methodology is presented here to evaluate the impact of uncertainty in pipe roughness values on decisions that are made using the model for a system expansion design using a steady state hydraulic model. To complete the analysis, model parameter uncertainty is evaluated using a first order second moment (FOSM) analysis of uncertainty. Parameter uncertainties are then propagated to model prediction uncertainties through a second FOSM for a defined set of demand conditions. Finally, model prediction uncertainties are embedded in an optimal design model to assess the effect of the uncertainties on model-based decisions. If uncertainty levels are large, the monetary benefits of reducing uncertainties from additional data collection can be addressed directly by examining the change in the design cost with additional data. For demonstration, the methodology is applied to a small literature network. Results suggest that the cost reductions are related to the convergence of the mean parameter estimates and the reduction of parameter variances. The impact of each factor changes during the calibration process as the parameters become more precise and the design is modified. Identification of the cause of cost changes, however, is not always obvious. [ABSTRACT FROM AUTHOR]

Cost of effective design or rehabilitation of the pipe networks depends largely on the available budget and satisfying pressures expected at the demand nodes. With the available market pipe sizes, one or more solutions of the same cost, the least cost, and simultaneously meeting the pressure constraints can be obtained from EPANET, a water distribution network simulation model, coupled with an optimization algorithm. Often, however, the least cost may be prohibitive from the overall budget consideration especially in developing countries and a less optimal solution is therefore the only option. The study shows a scheme in which solution selection is made, among solutions, which (1) is within allowable budget; and (2) yields acceptable total pressure deficit distributed more equally at several nodes instead of loaded on one or a few nodes only. A multiobjective optimization algorithm (NSGA-II) is coupled with water distribution network simulation software (EPANET) to provide the much needed Pareto front of the cost and nodal pressure deficit. A two-looped simple network is used to demonstrate the application of the scheme. [ABSTRACT FROM AUTHOR]

We formulate and solve an estimation problem for identifying both the time and location of contamination sources in municipal water networks using concentration measurements from a sparse sensor grid. Previous work showed that the direct sequential approach was insufficient to solve the time-dependent problem. Instead, a direct simultaneous approach is used, converging the network model and optimization problems simultaneously. An origin tracking algorithm is presented to reformulate the pipe expressions and characterize the time delays associated with network pipes. This algorithm removes the need to discretize along the length of the pipes and is efficient for large networks with many source and output nodes. The solution of the resulting nonlinear program provides the complete time-dependent injection profiles, identifying both the time and location of potential contamination sources. The effectiveness of this formulation is demonstrated on a network model for a real municipal water network. [ABSTRACT FROM AUTHOR]

The multiobjective optimization model described in this study is aimed at exploring the tradeoff between cost and resiliency for water distribution systems optimal design. Many have dealt previously with minimizing cost where reliability was quantified as a constraint. Fewer considered both cost and reliability as objectives. This work suggests a methodology for least cost versus reliability (quantified as resiliency) optimal design, introducing the following contributions: (1) a genetic algorithm multiobjective formulation integrating a previous theoretical result of a possible maximum of two adjacent discrete pipe diameters for a single pipe; (2) comparable results to previous best least-cost design solutions for the two-looped and Hanoi networks; (3) a real life-sized example application analysis for pipes reinforcement; and (4) an interpretation of resiliency through its comparison to two explicit reliability measures involving demands increase and pipes failure, reconfirming that resiliency improvement does not necessarily imply a reliability increase. Three example applications are explored through base runs and sensitivity analyses for demonstrating the study findings. [ABSTRACT FROM AUTHOR]