Search

This work presents an algorithm for water distribution systems water age clustering. The objective is to cluster a distribution system into water age sub-zones whose water age variability is minimized within each cluster. The algorithm stages are: (1) water age computation for each system node, (2) kick-off at a number of clusters equal to the number of nodes (i.e., each node initially acts as a cluster), (3) search for the two connected (by link) clusters which have the smallest absolute water age difference, and combine them into a single cluster; characterize their water age value as the weighted arithmetic mean of the two clusters, and (4) repeat step 3 until all nodes are lumped into a single cluster (i.e., the entire water distribution system). The algorithm thus spans all possible clusters starting from the total number of system nodes and up to a one cluster which holds the entire system layout. The model, through a clustering numbering trade-off, is demonstrated on a mid-size water distribution system. [ABSTRACT FROM AUTHOR]

Incorporating a system of monitoring stations to insure high quality water is being delivered to consumers has been acknowledged a crucial component required by any public water distribution system (WDS). Extensive studies have acknowledged the risk posed to large populations by an accidental or intentional contamination intrusion within a WDS; failure of an early warning system (EWS) to report a contamination event carries profound economic and public health consequences. Dynamic, stochastic conditions exist in municipal WDSs and a monitoring system needs to be designed according to a robust protocol that incorporates the inherent uncertainty in WDS operation, including: demand variability, and contamination event characteristic variability. This work composes the problem of locating the best junctions within a WDS to place fixed monitoring stations, and the best junctions to input innovative inline mobile sensors, in a multi-objective framework that incorporates uncertainty in the network's demands and EWS operation. Mobile sensors are carried by flow within pipes sampling and monitoring water quality in real time, and wirelessly uploading data to fixed transceiver beacons, providing an implicit preference towards demand dense regions. A multi-objective noisy messy genetic algorithm is structured to the problem at hand and employed on a small, medium, and large-scale model WDS to calculate near-optimal solutions from the large solutions space. This multi-objective framework provides high performing trade off (Pareto) sets comparing an EWS's system cost to numerous performance objectives incorporating non-deterministic objective functions to provide a high performing and resilient EWS. Results show a large trade off surface between the cost and the respective system's performance, with large diminishing returns. Although implementing a more expensive solution may provide little to no benefit from a traditional performance standpoint, implementing a system of higher cost can increase the systems resiliency, highlighting the importance of incorporating proper objective measures in optimization procedure. [ABSTRACT FROM AUTHOR]

Water distribution systems are liable to be contaminated. Depending on the nature of the contamination the cleaning process may include disinfection. The common requirement for disinfection is that the disinfectants will have a minimal contact time and a predefined minimum concentration with the pipe. The regulations consider disinfection of a single main but no specific procedures are given for larger portions of the network. This paper presents a multi-objective optimal operation plan for disinfection of water systems. The objective functions are to minimize the disinfection time and minimize the disinfectant quantities used while keeping the required regulations. [ABSTRACT FROM AUTHOR]

Certain soluble heavy metals are known to accumulate in the human body, resulting in ( inter alia ) toxicity to the kidney, liver, lungs, brain, heart and central nervous system. Water quality sensors can monitor small changes in water quality properties such as pH, TOC, turbidity, temperature, free chlorine concentration, and alkalinity. Heavy metals neither react with free chlorine nor consist of organic carbon; therefore, unless the solubility threshold is surpassed, the contaminant presence is distinguishable only by a change in the pH value. This characteristic makes the detection of heavy metal contamination events relatively tricky. In this work, a detailed aquatic chemistry multi-species model was developed within EPANET-MSX for the purpose of simulating the changes in water quality induced by cadmium contamination events. The model was applied on an example application network and the possible effects of various contamination events were explored. [ABSTRACT FROM AUTHOR]

Abstract: The presented study features an event detection model alerting for contamination events in water distribution systems. The developed model comprises a minimum volume ellipsoid (MVE) classifier, detecting outlier measurements, and a following sequence analysis utilizing the MVE binary output, for the classification of events. The model is updated continuously and exploits a constantly growing data base. The MVE enables simultaneous analysis of the water quality parameters. The multivariate analysis explores the relations between water quality parameters and detects changes in their common patterns. The suggested model applied an un-supervised classification method, eliminates the need for simulated events examples in the classifier construction. In the absent of satisfying information regarding the influence of contamination event on the parameter measurements, eliminating the use of any assumption contributes to the model reliability and generality. The model was trained on a real water utility data, and tested on randomly simulated events that were superimposed on the original data base. The model showed high accuracy and detection ability compared to previous studies. [Copyright &y& Elsevier]

Abstract: Decision-making processes often involve uncertainty. A common approach for modeling uncertain scenario-based decision-making progressions is through multi-stage stochastic programming. The size of optimization problems derived from multi-stage stochastic programs is frequently too large to be addressed by a direct solution technique. This is due to the size of the optimization problems, which grows exponentially as the number of scenarios and stages increases. To cope up with this computational difficulty, solution schemes turn to decomposition methods for defining smaller and easier to solve equivalent sub-problems, or through using scenario-reduction techniques. In our study a new methodology is proposed, titled Limited Multi-stage Stochastic Programming (LMSP), in which the number of decision variables at each stage remains constant and thus the total number of decision variables increases only linearly as the number of scenarios and stages grows. The LMSP employs a decision-clustering framework, which utilizes the optimal decisions obtained by solving a set of deterministic optimization problems to identify decision nodes, which have similar decisions. These nodes are clustered into a preselected number of clusters, where decisions are made for each cluster instead of for each individual decision node. The methodology is demonstrated on a multi-stage water supply system operation problem, which is optimized for flow and salinity decisions. LMSP performance is compared to that of classical multi-stage stochastic programming (MSP) method. [Copyright &y& Elsevier]

Abstract: A seasonal multi-year model for management of water quantities and salinities in regional water supply systems (WSS) was developed and implemented. Water is taken from sources which include aquifers, reservoirs, and desalination plants, and conveyed through a distribution system to consumers who require quantities of water under salinity constraints. The year is partitioned into seasons, and the operation is subject to technological, administrative, and environmental constraints such as water levels and salinities in the aquifers, capacities of the pumping, distribution system, and the desalination plants, and the desalination plants maximum removal ratios. The objective is to operate the system at minimum total cost. The objective function and some of the constraints are nonlinear, leading to a nonlinear optimization problem. The nonlinear optimization problem is solved efficiently by adapting (1) a set of manipulations that reduce the problem size and (2) a novel finite difference scheme for calculating the derivatives required by the optimization solver, entitled the Time-Chained-Method (TCM). The model is demonstrated on a small illustrative example and on a real sized regional water supply system in Israel. [Copyright &y& Elsevier]

Abstract: Municipal water distribution systems may consist of thousands to tens of thousands of hydraulic components such as pipelines, valves, tanks, hydrants, and pumping units. With the capabilities of today’s computers and database management software, “all pipe” hydraulic simulation models can be easily constructed. However, the uncertainty and complexity of water distribution systems interrelationships makes it difficult to predict its performances under various conditions such as failure scenarios, detection of sources of contamination intrusions, sensor placement locations, etc. A possible way to cope with these difficulties is to gain insight in to the system behavior by simplifying its operation through topological/connectivity analysis. In this study a tool of this kind based on graph theory is developed and demonstrated. The algorithm divides the system into clusters according to the flow directions in pipes. The resulted clustering is generic and can be utilized for different purposes such as water security enhancements by sensor placements at clusters, or efficient isolation of a contaminant intrusion. The methodology is demonstrated on a benchmark water distribution system from the research literature. [Copyright &y& Elsevier]

Ipclass — an interactive program for calibrating activated sludge systems is formulated and demonstrated. The model involves a heuristic screening algorithm for exploring the system equations structure, analytical computations of the sensitivities of the variables to the model coefficients, analytical computations of the gradients of the objective functions selected for the calibration process, and a gradient interactive steepest descent minimization scheme. The methodology was implemented in an end-user PC program: Ipclass, that uses the TK Solver® and Matlab® as computational engines, and Visual Basic as the shell. Applications to the activated sludge system models of and are presented. [Copyright &y& Elsevier]

This study deals with the integration of contamination simulations and a spatial event detection model. The simulation of contaminant intrusion includes detailed chemical-specific reactions within a multi-species water quality model. This set-up generates a scenario of contaminant distribution and produces a continuous multiple sensor stations database. Three organophosphates pesticides, Chlorpyrifos, Malathion, and Parathion, are modeled as possible contaminants. The event detection model comprises both local and spatial data analysis. The local model applies a previously developed single-sensor event detection model with a higher alert threshold that reduces false alarm rates. The spatial model considers upstream sensor datasets which are examined for their uniqueness and mutual resemblance in a sliding time window. The model utilizes outlier detection, data analyses, and network hydraulics for the detection of suspicious spatial trends. The proposed algorithm is capable of detecting events with low contamination signatures and spatial influence. Two case studies are explored and compared to the single sensor model. The proposed methodology resulted in a lower number of false alarms compared to the previous single sensor event detection modeling approach. [ABSTRACT FROM AUTHOR]

Effective decision support and model predictive control of real-time environmental systems require that evolutionary algorithms operate more efficiently. A suite of model predictive control (MPC) genetic algorithms are developed and tested offline to explore their value for reducing combined sewer overflow (CSO) volumes during real-time use in a deep-tunnel sewer system. MPC approaches include the micro-GA, the probability-based compact GA, and domain-specific GA methods that reduce the number of decision variable values analyzed within the sewer hydraulic model, thus reducing algorithm search space. Minimum fitness and constraint values achieved by all GA approaches, as well as computational times required to reach the minimum values, are compared to large population sizes with long convergence times. Optimization results for a subset of the Chicago combined sewer system indicate that genetic algorithm variations with a coarse decision variable representation, eventually transitioning to the entire range of decision variable values, are best suited to address the CSO control problem. Although diversity-enhancing micro-GAs evaluate a larger search space and exhibit shorter convergence times, these representations do not reach minimum fitness and constraint values. The domain-specific GAs prove to be the most efficient for this case study. Further MPC algorithm developments are suggested to continue advancing computational performance of this important class of problems with dynamic strategies that evolve as the external constraint conditions change. [ABSTRACT FROM AUTHOR]

Leak and backflow detections are essential aspects of Water Distribution Systems (WDSs) monitoring and are commonly fulfilled using approaches that are based on static sensor networks and point measurements. Alternatively, we propose a mobile, wireless sensor network solution composed of mobile sensor nodes that travel freely inside the pipes with the water flow, collect and transmit measurements in near-realtime (called sensors) and static access points (called beacons). This study complements the tremendous progress in mobile sensor technology. We formulate the sensor and beacon optimal placement task as a Mixed Integer Nonlinear Programming (MINLP) problem to maximize localization accuracy with budget constraint. Given the high time complexity of MINLP formulation, we propose a disjoint scheme that follows the strategy of splitting the sensor and beacon placement problems and determining the respective number of sensors and beacons by exhaustive search in linear time. [ABSTRACT FROM AUTHOR]

Optimal sensor placement for detecting contamination events in water distribution systems is a well explored problem in water distribution systems security. We study herein the problem of sensor placement in water networks to minimize the consumption of contaminated water prior to contamination detection. For any sensor placement, the average consumption of contaminated water prior to event detection amongst all simulated events is employed as the sensing performance metric. A branch and bound sensor placement algorithm is proposed based on greedy heuristics and convex relaxation. Compared to the state of the art results of the battle of the water sensor networks (BWSN) study, the proposed methodology demonstrated a significant performance enhancement, in particular by applying greedy heuristics to repeated sampling of random subsets of events. [ABSTRACT FROM AUTHOR]