Accidental drinking water contamination has long been and remains a major threat to water security throughout the world. Consequently, contamination source identification is an important and difficult problem in the managing safety in water distribution systems. This problem involves the characterization of the contaminant source based on observations that are streaming from a set of sensors in the distribution network. Since contamination spread in a water distribution network is relatively quick and unpredictable, rapid identification of the source location and related characteristics is important to take contaminant control and containment actions. As the contaminant event unfolds, the streaming data could be processed over time to adaptively estimate the source characteristics. This provides an estimate of the source characteristics at any time after a contamination event is detected, and this estimate is continually updated as new observations become available. We pose and solve this problem using a dynamic optimization procedure that could potentially provide a real-time response. As time progresses, additional data is observed at a set of sensors, changing the vector of observations that should be predicted. Thus, the prediction error function is updated dynamically, changing the objective function in the optimization model. We investigate a new multi population-based search using an evolutionary algorithm (EA) that at any time represents the solution state that best matches the available observations. The set of populations migrates to represent updated solution states as new observations are added over time. At the initial detection period, non-uniqueness is inherent in the source-identification due to inadequate information, and, consequently, several solutions may predict similarly well. To address nonuniqueness at the initial stages of the search and prevent premature convergence of the EA to an incorrect solution, the multiple populations in the proposed methodology are designed to maintain a set of alternative solutions representing different non-unique solutions. As more observations are added, the EA solutions not only migrate to better solution states, but also reduce the number of solutions as the degree of non-uniqueness diminishes. This new dynamic optimization algorithm adaptively converges to the best solution(s) to match the observations available at any time. The new method will be demonstrated for a contamination source identification problem in an illustrative water distribution network.
[1]
Emily M. Zechman,et al.
An evolutionary algorithm to generate alternatives (EAGA) for engineering optimization problems
,
2004
.
[2]
John H. Holland,et al.
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
,
1992
.
[3]
Srinivasa Lingireddy,et al.
Hydraulic Network Calibration Using Genetic Optimization
,
2002
.
[4]
Angus R. Simpson,et al.
Leak Detection and Calibration Using Transients and Genetic Algorithms
,
2000
.
[5]
Lorenz T. Biegler,et al.
Contamination Source Determination for Water Networks
,
2005
.
[6]
Carl D. Laird,et al.
Nonlinear Programming Strategies for Source Detection of Municipal Water Networks
,
2003
.
[7]
Dragan Savic,et al.
Genetic Algorithms for Least-Cost Design of Water Distribution Networks
,
1997
.
[8]
G. Mahinthakumar,et al.
Hybrid Genetic Algorithm—Local Search Methods for Solving Groundwater Source Identification Inverse Problems
,
2005
.
[9]
A. Simpson,et al.
An Improved Genetic Algorithm for Pipe Network Optimization
,
1996
.
[10]
Robert M. Clark,et al.
Water Distribution Systems Analysis Symposium 2006
,
2008
.
[11]
Bithin Datta,et al.
Optimal Monitoring Network and Ground-Water–Pollution Source Identification
,
1997
.