Genetic algorithms in aquifer management
✍ Scribed by Walter Cedeño; Rao V. Vemuri
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 623 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1084-8045
No coin nor oath required. For personal study only.
✦ Synopsis
A new genetic algorithm based on multi-niche crowding is capable of efficiently locating all the peaks of a multi-modal function. By associating these peaks with the utility accrued from different sets of decision variables it is possible to extend the use of genetic algorithms to multi-criteria decision making problems. This concept is applied to address the problems arising in the context of remediation of a contaminated aquifer. The multiniche crowding genetic algorithm is used to decide the optimal location of pumping wells. The aquifer dynamics are simulated by repeatedly solving the partial differential equations describing the flow of water using SUTRA code. Output of this simulation constitutes the input to the genetic algorithm.
📜 SIMILAR VOLUMES
Bertoni, A. and M. Dorigo, Implicit parallelism in genetic algorithms (Research Note), Artificial Intelligence 61 (1993) 307-314. This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of n3/c,VTl to the number of schemata usefu
Design is a complex engineering activity, in which computers are more and more involved. The design task can often be seen as an optimization problem in which the parameters or the structure describing the best quality design are sought. Genetic algorithms constitute a class of search algorithms es
A genetic algorithm has been developed for molecular mechanics calculations. It has been proved to be a robust and efficient structure optimization technique. Because it uses randomly generated starting structures and stochastic operators, the resulting structures are not subjected to the chemist's