Genetic algorithms and cellular automata in aquifer management

A groundwater management problem is presented involving pumping cost minimization with both well discharges and well locations as decision variables. A grid of candidate well locations is set up and optimal arrangements of wells are sought within this discrete space. A genetic algorithm approach is presented with the following particular features: (a) A suitable scaling is applied to the objective function in order to alleviate its regionally flat behavior. (b) No penalty functions are involved in constraint handling. Instead, the feasible region is transformed into a rectangular domain. The transformation introduced is proved to be bijective. (c) A binary representation of well configurations is presented and compared to a combinatorial one. The binary representation necessitates the introduction of specially designed genetic operators. Besides purely genetic algorithms, the concept of cellular automaton is introduced as the basis of an alternative formulation of the optimization problem. The lattice of the cellular automaton provides the discrete set of candidate well positions. The well configuration is represented by a group of agents occupying an equal number of lattice sites. The agents change positions as dictated by the structure of the automaton and, also, by an associated genetic algorithm, which directs the evolution of the whole scheme toward an optimal configuration. An improved performance of this approach is noted and discussed in comparison to the purely genetic algorithm schemes of the present work. A simulated annealing approach is also applied to the same problem for comparison purposes. Finally, a new and more efficient hybrid annealing–genetic approach is introduced and discussed.