Search

This paper presents a new valve positioning algorithm (VPA) for water network pressure reduction. The proposed algorithm is a graph theory-based algorithm combined with EPANET2.2 to position pressure-reducing valves (PRVs) at the most effective locations, having the most effect on downstream pressure reduction, and then calculates the setpoint for locally controlled valves. Each algorithm solution positions one valve on the edge with the highest-pressure reduction indicator calculated using the depth-first search algorithm. The setpoint is then calculated according to downstream pressure differences to the minimum service pressure to be supplied. The PRV location and setpoint found by the algorithm may be used to install and set locally controlled PRVs or serve as a guide for positioning remote-controlled PRVs. The algorithm is demonstrated on a simple example network using demand-driven analysis (DDA), pressure-driven analysis (PDA), and genetic algorithms (GA) and on a medium and a large example application (DDA). Any number of PRVs may be installed using the algorithm, which returns stable results and very short solution times while maintaining minimum service pressure requirements to the critical consumers. [ABSTRACT FROM AUTHOR]

Reservoir systems are essential for water resources management. The application and development of optimization techniques for optimal reservoir operation is therefore a valuable undertaking. This paper presents a modified firefly algorithm (MFA) and applies it to optimally solve reservoir operation problems. Three well-known benchmark multireservoir operation problems are optimized for energy production. The results of the MFA are compared with results obtained with other mathematical programming approaches, such as linear programming (LP), differential dynamic programming (DDP), and discrete DDP (DDDP), the genetic algorithm (GA), the multicolony ant algorithm (MCAA), the honey-bee mating optimization (HBMO) algorithm, the water cycle algorithm (WCA), the bat algorithm (BA), and the biogeography-based optimization (BBO) algorithm. The MFA was found to be more effective than alternative optimization methods in solving the test problems demonstrating its strong potential to tackle multireservoir operation problems. This paper's results indicate that the MFA differed by 0.01 and 0.79% with the LP global optimal solutions of a continuous four-reservoir problem (CFP) and a continuous 10-reservoir problem (CTP), respectively. The objective function of a discrete four-reservoir problem (DFP) obtained with the MFA is equal to the LP's objective function. This paper demonstrates that the MFA is a competitive optimization method with which to solve a variety of reservoir operation problems. [ABSTRACT FROM AUTHOR]

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]

This paper presents a case study on the application of a dynamic framework for the intelligent control of flooding in the Boise River system in Idaho. This framework couples a robust and numerically efficient hydraulic routing approach with the popular multi-objective nondominated sorting genetic algorithm II (NSGA-II). The novelty of this framework is that it allows for controlled flooding when the conveyance capacity of the river system is exceeded or is about to exceed. Controlled flooding is based on weight factors assigned to each reach of the system, depending on the amount of damage that would occur, should a flood occur. For example, an urban setting would receive a higher weight factor than a rural or agricultural area. The weight factor for a reach does not need to be constant as it can be made a function of the flooding volume (or water stage) in the reach. The optimization algorithm minimizes flood damage by favoring low-weighted floodplain areas (e.g., rural areas) rather than high-weighted areas (e.g., urban areas) for the overbank flows. The proposed framework has the potential to improve water management and use of flood-prone areas in river systems, especially of those systems subjected to frequent flooding. This work is part of a long-term project that aims to develop a reservoir operation model that combines short-term objectives (e.g., flooding) and long-term objectives (e.g., hydropower, irrigation, water supply). The scope of this first paper is limited to the application of the proposed framework to flood control. Results for the Boise River system show a promising outcome in the application of this framework for flood control. [ABSTRACT FROM AUTHOR]

This paper reports the use of many-objective optimization for water distribution system (WDS) design or rehabilitation problems. The term many-objective optimization refers to optimization with four or more objectives. The increase in the number of objectives brings new challenges for both optimization and visualization. This study uses a multiobjective evolutionary algorithm termed the epsilon Nondominated Sorted Genetic Algorithm II (-NSGAII) and interactive visual analytics to reveal and explore the tradeoffs for the Anytown network problem. The many-objective formulation focuses on a suite of six objectives, as follows: (1) capital cost, (2) operating cost, (3) hydraulic failure, (4) leakage, (5) water age, and (6) fire-fighting capacity. These six objectives are optimized based on decisions related to pipe sizing, tank siting, tank sizing, and pump scheduling under five different loading conditions. Solving the many-objective formulation reveals complex tradeoffs that would not be revealed in a lower-dimensional optimization problem. Visual analytics are used to explore these complex tradeoffs and identify solutions that simultaneously improve the overall WDS performance but with reduced capital and operating costs. This paper demonstrates that a many-objective visual analytics approach has clear advantages and benefits in supporting more informed, transparent decision-making in the WDS design process. [ABSTRACT FROM AUTHOR]

This paper deals with methods aimed at the effective and efficient detection of accidental and/or intentional contaminant intrusion(s) in water distribution systems. The objective of this paper is to present a methodology entitled sensors local optimal transformation system (SLOTS) to address both single-objective and multiobjective sensor layout problems. SLOTS is tested on two benchmark water distribution networks used for the Battle of the Water Sensors Networks challenge (BWSN), held as part of the Water Distribution Systems Analysis Symposium, in Cincinnati in 2006. The objectives considered are detection likelihood and the expected population affected prior to detection. The results obtained demonstrate that SLOTS sensor placements are often near optimal. For both single-objective and multiobjective cases, SLOTS is shown to be capable of identifying placements which are consistently better performing than one of the best BWSN methodologies, the greedy algorithm. [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 area of systematic identification of contamination sources in water distribution systems is in its infancy and is rapidly growing. The real water distribution network problem poses many challenges that current methods usually assume away to facilitate manageable method development and testing. Current methods may not readily and efficiently address issues, such as multiple sources, unknown contamination types with different reaction kinetics, use of different types of sensors with varying degree of resolution, dynamically varying demand and sensor information, and uncertainty and errors in the data and measurements. With the aim of addressing these imminent challenges, this paper reports the findings of an ongoing research investigation that develops and tests an evolutionary algorithm-based flexible and generic procedure, which is structured within a simulation-optimization paradigm. This paper describes the specific implementation of the method using evolution strategies (ESs), a population-based heuristic global search algorithm. A key component of designing this source characterization method is to define a compact, but comprehensive, solution encoding structure. The new method is constructed using a tree-based encoding design to enable the representation of variable-length decision vectors and a set of associated genetic operators that enable an efficient search. This algorithm is successfully tested and demonstrated to have consistently good performance for several instances of an illustrative water distribution contamination case study. As the ES-based algorithm conducts a probabilistic search, its robustness is tested using multiple random trials, and the method is shown to exhibit a robust behavior. [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 paper presents a coupled self-adaptive multiobjective differential evolution and network flow algorithm for the optimal operation of complex multipurpose reservoir systems. The developed algorithm (i.e., self-adaptive multiobjective differential evolution) is compared to nondominated sorting genetic algorithm II using a set of common test problems and a real-world case study. An out-of- kilter method for minimal-cost flow problems is used to optimize the water resource system from self-adaptive multiobjective differential evolution inputs driven by the evolutionary process. Self-adaptive multiobjective differential evolution is then used to evaluate objective functions based on the outputs from out-of-kilter algorithm and the process continues until the stop criterion is met. The advantages of the proposed approach include (1) flexible evolutionary algorithms for solving highly complex objective function, and (2) efficient network flow method for dealing with large and highly constrained problems. The case study includes one part of a complex water supply system located in southwestern Brazil that provides water for almost 20 million people in Sao Paulo metropolitan area. The objectives of the case study include minimization of demand shortage (the difference between demand for water and available water supply), maximization of water quality (or minimization of the deviation from the water quality standards), and minimization of pumping cost. The coupled model is applied to the case study using one inflow scenario representing a drought period with inflows below historical average. Multiobjective analyses are performed by comparing two pairs of objective functions, as follows: (1) minimization of demand shortage versus minimization of pumping cost, and (2) minimization of demand shortage versus minimization of the deviation from the water quality standards. The problem constraints include reservoir capacity, capacity of tunnels, channel flow limitations, and minimum downstream release for all reservoirs within the system. The proposed coupled model (self-adaptive multiobjective differential evolution and out-of-kilter) is outperforming both pure self-adaptive multiobjective differential evolution and nondominated sorting genetic algorithm II, as it requires significantly smaller number of generations to derive the Pareto front. In addition, the proposed approach is capable of handling larger problems without major computational burden. The coupled model and self-adaptive multiobjective differential evolution also converge closer to, and provide better coverage of the true Pareto front than, nondominated sorting genetic algorithm II. [ABSTRACT FROM AUTHOR]

The effort to manage irrigation water use through the adoption and implementation of agricultural best management practices (BMPs) is crucial for meeting water bodies' sustainability in water-deficient agricultural areas. This paper presents the development of an efficient decision support tool able to suggest the optimal location for placing high- and low-tech irrigation BMPs, such as deficit irrigation, conveyance efficiency improvement, precision irrigation, and wastewater reuse, and demonstrates its application in the water-scarce Pinios river basin in central Greece. The tool uses the SWAT (soil and water assessment tool) model as the BMP and hydrologic simulator and a multiobjective genetic algorithm, which, based on calculated cost data, optimizes the cost-effectiveness of management schemes across the landscape. From the analysis of the results produced and the optimal river basin BMP configurations under the current and a volumetric water pricing scenario and under a variation of the cost parameters, the study concludes that a number of different BMPs at an affordable implementation cost, along with a tiered water pricing system that could address socioeconomic heterogeneities, would form a sustainable action plan against desertification in the highly water-deficient Pinios basin. The methodology and tool are considered to be easily applicable in other river basins and could be used to assist in more cost-effective implementation of environmental legislation. [ABSTRACT FROM AUTHOR]

In recent years, a number of evolutionary algorithms have been proposed for optimizing the design and operation of water distribution systems (WDSs). These evolutionary algorithms include genetic algorithms, ant colony optimization, particle swarm optimization, the shuffled leaping frog algorithm, and differential evolution. Although there have been some comparisons made of the performance of the various algorithms, very few of these comparisons have been carried out in a completely rigorous manner. The main aim of this paper is to introduce a methodology for the rigorous comparison of various algorithms for the optimum design of water distribution systems. The methodology involves comparing the various algorithms in terms of (1) the best solution obtained; (2) the speed of convergence; and (3) the spread and consistency of the solutions obtained over a number of random starting seeds and numbers of evaluations. As a demonstration of the methodology, the techniques of genetic algorithms (GA), particle swarm optimization (PSO), and differential evolution (DE) are applied to two frequently used WDS case studies, namely the New York Tunnels and Hanoi water networks. In addition, the techniques are applied to a real-size water distribution system consisting of 476 pipes. The results obtained show that the algorithm performances depend on the specific problem and the number of function evaluations allowed. Moreover, it is shown that correct calibration is an essential phase for a fair comparison of evolutionary algorithms. In fact, the best parameters are a function of the problem characteristics, of the objective function and of the variants in the algorithm operators. Therefore the adoption of configurations tested on slightly different versions of the algorithms can lead to quite different results. [ABSTRACT FROM AUTHOR]

Streams and their associated biological communities are among our most valuable natural resources. Humans rely on the environmental services provided by streams in a myriad of ways. However, in some areas, excessive groundwater pumping exacerbates the already critical pressure on streamflow and must be managed through effective planning. Based on economic and hydrogeological concepts, this study estimates the quantity of streamflow depletion that is attributable to groundwater pumping and the negative impact on the socioeconomic system if groundwater pumping must be constrained to restore streamflow. The primary objective of this paper is to develop a multiobjective nonlinear optimization model to simulate the tradeoffs between streamflow restoration and economic welfare loss in a Chicago suburban county, McHenry County. The multiobjective optimization was conducted at both county and municipality levels. An evolutionary algorithm, the nondominated sorting genetic algorithm, was used to solve the optimization model and to identify the tradeoff curve (Pareto frontier). Comparing municipal Pareto frontiers shows spatially heterogeneous costs of preserving streamflow through various shadow prices and also the different capacities of restoring streamflow. The results include discussion of the shapes of the Pareto frontier, the sensitivity of the pumping boundary constraints, and return flow coefficients. It is concluded that the multiobjective optimization model provides a useful framework to consider conflicting objectives in a typical environmental management and planning process, and that the findings can help decision-makers and planners to formulate effective groundwater pumping strategies. [ABSTRACT FROM AUTHOR]

The ability to monitor the flow and how water transforms throughout water networks would greatly improve the management of those distribution systems. The sensor placement problem attempts to find the locations of monitoring devices that would optimally observe water quality and protect consumers from accidents and intrusions of contaminants. In some related critical scenarios, the absence of information about possible contamination events, including knowledge of the injection sources, contaminant types or mass, time of pollution, and the variability of water network input parameters, such as the nodal demands and the pipe roughness coefficients, raises several challenges that must be addressed by the sensor network design process. In this paper, the authors describe a stochastic parameterization and analysis of uncertainty for the design of sensor networks aimed at maximizing the probability of detection of accidents and intrusions in water distribution networks. A challenge with such an approach, in particular, when applied to large urban water networks is the size of the ensuing computational model and the associated numerical optimization problem. This problem is compounded in the presence of uncertainty, where the need to deal with a large number of statistically plausible scenarios underscores the need for efficient yet credible algorithms for addressing the sensor placement issue. In addition to modeling aspects, the authors also address a challenge associated with the computational feasibility and performance of relevant numerical algorithms. Specifically, and through the use of submodular cost functions, the authors are able to solve the optimization problem with a greedy algorithm, yielding sufficient computational performance that allows for the description of stochastic water demands in the context of Monte Carlo simulations. Imperfect sensors are further accounted for while maintaining submodularity. The results show that the optimal sensor network layout is highly dependent on whether uncertainty in the stochastic parameters has been introduced and whether individual sensors can fail or not. [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]

Optimal design of tunnels and surge tanks is a major concern in the implementation and operation of large hydropower plants, particularly those in which tunnels are long and water hammer is likely. In this paper, flow simulation and an optimization process have been linked in an iterative manner to develop a general model for the optimal design of hydropower tunnels and surge tanks for the emergency condition of operation (maximum surge pressure). The governing equations for the analysis of transient flow in conduits are solved using a finite difference scheme. Furthermore, a genetic algorithm (GA) optimization technique is utilized to select the optimal diameter for the headrace tunnel, penstocks, and surge tanks. The benefit-cost ratio is considered as the objective function in the optimization analysis. The proposed method was used to design diameters for Marun hydropower tunnels (an in-operation large hydropower dam located in southwest Iran). The results were compared with results from a nonlinear optimization technique. They revealed considerable savings in construction cost, attributable to the application of GA. The calculated pressures across the tunnels with and without surge tank agree with valve closure theory and previous studies. The model is able to optimize diameters for a branching system of tunnels and penstocks with surge tanks. [ABSTRACT FROM AUTHOR]

Diminishing marginal utility is an important characteristic of water resources systems. With the assumption of diminishing marginal utility (i.e., concavity) of reservoir utility functions, this paper derives a monotonic relationship between reservoir storage and optimal release decision under both deterministic and stochastic conditions, and proposes an algorithm to improve the computational efficiency of both deterministic dynamic programming (DP) and stochastic dynamic programming (SDP) for reservoir operation with concave objective functions. The results from a real-world case study show that the improved DP and SDP exhibit higher computational efficiency than conventional DP and SDP. The computation complexity of the improved DP and SDP is (order of , the number of state discretization) compared to with conventional DP and SDP. [ABSTRACT FROM AUTHOR]

Computational cost is a critical issue for large-scale water-resource optimization under uncertainty, since time-intensive Monte Carlo simulations are often required to evaluate over multiple parameter realizations. This paper presents an efficient approach for replacing most Monte Carlo simulations with surrogate models within a noisy genetic algorithm (GA). The surrogates are trained to predict the posterior expectations online on the basis of stochastic decision theory, using Monte Carlo simulation results created during the GA run. The surrogates, which in this application are neural networks, are adaptively updated to improve their prediction performance as the search progresses. A Latin hypercube sampling method is used to efficiently sample parameters for the Monte Carlo simulation, and the sampling results are archived so that the estimate of posterior expectation can be iteratively improved in an efficient manner. In addition, the GA is modified to incorporate hypothesis tests in its selection operator to account for sampling noise. The method is applied to a field-scale groundwater remediation design case study, whereas the primary source of uncertainty stems from hydraulic conductivity values in the aquifers. The results show that the method identified more reliable and cost-effective solutions with 86-90% less computational effort than the purely physically based noisy GA approach. [ABSTRACT FROM AUTHOR]

Reservoir flood control operation (RFCO) is a large scale multiobjective problem with complex constraints that require powerful algorithms to solve it. As a new metaheuristic evolutionary algorithm, shuffled frog leaping algorithm (SFLA) has the potential ability to solve multiobjective optimization problems because of its group evolution characteristic. In this paper, we present a novel multiobjective shuffled frog leaping algorithm (MOSFLA), which incorporates an archiving strategy based on self-adaptive niche method to maintain the nondominated solutions, and improves the memetic evolution process of SFLA to adapt to the multiobjective optimization problem. The numerical experiments of five Zitzler-Deb-Thiele functions indicate that MOSFLA yields better-spread solutions and converges closer to the true Pareto frontier than non-denominated sorting genetic algorithm (NGSA)-II and SPEA2. Furthermore, MOSFLA is applied to solve RFCO of the Three Gorges Project, and the results demonstrate that this algorithm can generate a solution set with uniform spread and good convergence for the problems with two conflicting objectives, including minimizing the highest reservoir water level and minimizing the peak flood discharge. Additionally, if compared with dynamic programming and NGSA-II, MOSFLA is verified to be more efficient and competitive, and thus can be provided as a new effective alternative for solving the complex reservoir operation problems. [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]

This paper describes a model developed for optimizing water supply plans for water customers when a water network is partially operational due to the destruction of water networks by malicious attacks or any catastrophic events. The model uses the information regarding the priority of water customers in emergency situations, their functional sensitivities to water supply, and the dynamic nature of water demand patterns. The solutions generated from the model are water rationing plans which can guarantee at least a short-term water supply to water customers during any 24-h period. A genetic algorithm based program linked with a hydraulic solver (EPANET 2.0) is developed to find optimal water rationing plans. A case study indicates that the proposed model can successfully generate water rationing plans to reduce the consequences while meeting hydraulic constraints in water networks. The model developed in this study is also applicable to extreme water supply shortage situations due to severe drought or nonintentional incidents such as major pump failures and main breaks. [ABSTRACT FROM AUTHOR]

Optimal sewer design aims to find cost-effective solutions for designing sewer networks, and genetic algorithms (GAs) are one of the state-of-the-art optimization techniques that have been applied to this problem. However, finding good quality solutions by using a GA can be prohibitively time consuming, especially when designing large networks. This paper introduces an efficient and robust hybrid optimization method, which deals with the design task in a multiobjective optimization manner using two consecutive stages. A localized approach based on cellular automata principles is applied at the first stage to obtain a set of preliminary solutions, which are then used to seed a multiobjective genetic algorithm (MOGA) at the second stage. Two large real sewer networks are tested for case studies. Results clearly show that the hybrid approach can surpass the standard MOGA in terms of optimization efficiency and quality of solutions. [ABSTRACT FROM AUTHOR]

Following the events of September 11, 2001, in the United States, world public awareness for possible terrorist attacks on water supply systems has increased dramatically. Among the different threats for a water distribution system, the most difficult to address is a deliberate chemical or biological contaminant injection, due to both the uncertainty of the type of injected contaminant and its consequences, and the uncertainty of the time and location of the injection. An online contaminant monitoring system is considered as a major opportunity to protect against the impacts of a deliberate contaminant intrusion. However, although optimization models and solution algorithms have been developed for locating sensors, little is known about how these design algorithms compare to the efforts of human designers, and thus, the advantages they propose for practical design of sensor networks. To explore these issues, the Battle of the Water Sensor Networks (BWSN) was undertaken as part of the 8th Annual Water Distribution Systems Analysis Symposium, Cincinnati, Ohio, August 27–29, 2006. This paper summarizes the outcome of the BWSN effort and suggests future directions for water sensor networks research and implementation. [ABSTRACT FROM AUTHOR]

The short-term optimal hydrogeneration planning is a complicated nonlinear constrained optimization problem with water delay time. To overcome the shortcomings of a standard genetic algorithm, this paper proposes a new real-value encoding self-adaptive chaotic genetic algorithm to solve this problem, which designs a new crossover operator in light of probability distribution function and a self-adaptive chaotic mutation operator combined chaotic dynamic character with artificial neural network theory. Constraints can be dealt with by using a simple direct comparison penalty function method without the need of any penalty coefficient. The feasibility of the proposed method is demonstrated for short-term generation scheduling of two test hydrosystems and the test results are compared with those obtained by the standard genetic algorithm in terms of solution quality and convergence characteristic. The simulation results show that the proposed method is capable of obtaining higher quality solutions. [ABSTRACT FROM AUTHOR]

The efficient and effective search for the optimum design solution of a water distribution network using genetic algorithms (GAs) is governed by several factors such as representation scheme, population size, hydraulic simulation model, fitness function, penalty method, GA operators, number of generations, and more importantly the size of the search space. This paper proposes a modified GA that uses basic operators along with their derivatives randomly. Further, a methodology based on critical path method is suggested to reduce the search space. A software tool, GA-WAT, based on the proposed methodology is developed and first tested and verified for its efficiency and effectiveness on two previously published single source networks. Later, it is applied to the optimal design of a larger, two-source hypothetical network. The results obtained indicate that the modified GA with reduction in search space proposed herein is more effective, especially for large practical networks. [ABSTRACT FROM AUTHOR]

A common method for assessing the energy potential of hydropower systems in Iran is the sequential streamflow routing with control on the energy-yield reliability. The method results in developing a reliability-based simulation (RBS) model that is used to analyze single-reservoir hydropower systems. In most of the cascade hydropower systems in the country, a single-reservoir RBS model is usually employed in the design and operation of each of the systems reservoirs. This paper presents a multireservoir RBS model considering the integrated operation of the systems. The model employs the general algorithm of the single-reservoir RBS model; however, with a single-period optimization submodel in determining releases from reservoirs during the system simulation. The objective function of the submodels minimizes the sum of reservoir releases and/or maximizes the sum of reservoir storages in each of the time periods, subject to a reliability constraint on the system’s energy yield. The single and multireservoir RBS models are applied in the Khersan hydropower system located in Iran as a case study. The multireservoir RBS, compared to the single-reservoir model, results in 7.9% excess firm-energy yield in reliability of 90%. [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]

This paper develops a multicommodity flow model to optimize water distribution and water quality in a regional water supply system. Waters from different sources with different qualities are considered as distinct commodities that concurrently share a single water distribution system. The model can accommodate two-way flow pipes, represented by undirected arcs, and the perfect mixing condition. Additionally, blending requirements are specified at certain control nodes within the system to ensure that downstream users receive the desired water quality. The optimization model is highly nonlinear and solved by a hybrid genetic algorithm (GA). The GA is first used to globally search for the directions of all undirected arcs. Then a generalized reduced gradient (GRG) algorithm embedded in the GA is used to optimize the objective function for fitness evaluation. The proposed methodology was first tested and verified on a hypothetical system and then applied to the regional water distribution system of the Metropolitan Water District of Southern California. The results obtained indicate that the proposed hybrid GA is a viable way of converting an undirected network to a directed network by separating the complicating variables, and that the resulting directed network model can be solved iteratively and efficiently by a gradient-based algorithm. [ABSTRACT FROM AUTHOR]

In this paper the authors propose a global-local methodology for optimizing the short-term operation of hydroelectric plants. The authors determine the tradeoffs between minimizing the daily release from the plant and minimizing the number of startups and shutdowns of the generating units. The model is formulated as a mixed integer, nonlinear programming optimization problem with multiple objectives. The authors consider the nonlinearities of the generating units without simplifications or approximations. The authors develop a solution method that combines an evolutionary algorithm for the global search of the integer variables and a gradient-based local optimizer for the continuous variables. The local optimizer is embedded in the global search algorithm. Convergence is achieved by iterating between the global search and the local optimizer. The proposed methodology is applied to a moderately sized Brazilian hydroelectric plant that belongs to the national interconnected system. Additionally, a comparative study was conducted using historical operational records. The results demonstrate that the proposed methodology is feasible for online daily operations and delivers two specific benefits. The first is the efficiency gained, as the model seeks to operate the generating units as close as possible to their most efficient operating points. The second benefit is reduction of the units' maintenance costs, as the model minimizes switching on/off of the generating units. [ABSTRACT FROM AUTHOR]

This paper shows how pipe replacements and control valve installations can be optimized in water distribution networks to reduce leakage, under minimum nodal pressure constraints. To this end, a hybrid multiobjective algorithm, which has pipe diameters and valve positions and settings as decisional variables, was set up. The algorithm also enables identification of the isolation valves that have to be closed in order to improve effectiveness of the control valves installed. The algorithm is initially applied to the optimal valve location problem, where it explores the trade-off between the number of installed control valves and the daily leakage volume. In this context, the analysis of the results proves the new algorithm more effective than a multiobjective genetic algorithm widely adopted in the scientific literature. Furthermore, it shows that if some isolation valves identified ad hoc are closed in the network, the installation of control valves determines larger leakage volume reductions. In a second application of the algorithm, pipe replacements and control valve installations are simultaneously performed. In this case, a Pareto front of trade-off solutions between installation costs and daily leakage volume is obtained. For the choice of the final solution within the front, an economic criterion based on the long-term convenience analysis is also illustrated. [ABSTRACT FROM AUTHOR]