Optimal sampling in a noisy genetic algorithm for risk-based remediation design

A groundwater management model has been developed that predicts human health risks and uses a noisy genetic algorithm to identify promising risk-based corrective action (RBCA) designs. Noisy genetic algorithms are simple genetic algorithms that operate in noisy environments. The noisy genetic algorithm uses a type of noisy fitness function (objective function) called the sampling fitness function, which utilises Monte-Carlo-type sampling to find robust designs. Unlike Monte Carlo simulation modelling, however, the noisy genetic algorithm is highly efficient and can identify robust designs with only a few samples per design. For hydroinformatic problems with complex fitness functions, however, it is important that the sampling be as efficient as possible. In this paper, methods for identifying efficient sampling strategies are investigated and their performance evaluated using a case study of a RBCA design problem. Guidelines for setting the parameter values used in these methods are also developed. Applying these guidelines to the case study resulted in highly efficient sampling strategies that found RBCA designs with 98% reliability using as few as 4 samples per design. Moreover, these designs were identified with fewer simulation runs than would likely be required to identify designs using trial-and-error Monte Carlo simulation. These findings show considerable promise for applying these methods to complex hydroinformatic problems where substantial uncertainty exists but extensive sampling cannot feasibly be done.

[1]  David E. Goldberg,et al.  Risk‐based in situ bioremediation design using a noisy genetic algorithm , 2000 .

[2]  Aysegul Aksoy,et al.  Effect of Sorption Assumptions on Aquifer Remediation Designs , 2000 .

[3]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[4]  David E. Goldberg,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.

[5]  Benjamin W. Wah,et al.  Scheduling of Genetic Algorithms in a Noisy Environment , 1994, Evolutionary Computation.

[6]  Keith Beven,et al.  Stochastic capture zone delineation within the generalized likelihood uncertainty estimation methodology: Conditioning on head observations , 2001 .

[7]  J. Fitzpatrick,et al.  Genetic Algorithms in Noisy Environments , 2005, Machine Learning.

[8]  S. Ranjithan,et al.  Using genetic algorithms to solve a multiple objective groundwater pollution containment problem , 1994 .

[9]  Q. J. Wang The Genetic Algorithm and Its Application to Calibrating Conceptual Rainfall-Runoff Models , 1991 .

[10]  M. Wang,et al.  Optimal Remediation Policy Selection under General Conditions , 1997 .

[11]  David E. Goldberg,et al.  Optimal Sampling For Genetic Algorithms , 1996 .

[12]  T. Clement A Modular Computer Code for Simulating Reactive Multi-Species Transport in 3-Dimensional Groundwater Systems , 1999 .

[13]  John J. Grefenstette,et al.  Genetic Search with Approximate Function Evaluation , 1985, ICGA.

[14]  T. P. Clement,et al.  Modeling Multispecies Reactive Transport in Ground Water , 1998 .

[15]  Brad L. Miller,et al.  Noise, sampling, and efficient genetic algorthms , 1997 .

[16]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[17]  Of references. , 1966, JAMA.

[18]  David E. Goldberg,et al.  Designing a competent simple genetic algorithm for search and optimization , 2000 .