Professional Documents
Culture Documents
1A
1. INTRODUCTION
The genetic algorithm (GA) is finding wide
acceptance in many disciplines. This paper
introduces the elements of GAs and their
application
to
environmental
science
problems.
The genetic algorithm is an optimization
tool that mimics natural selection and
genetics. The parameters to be optimized are
the genes, which are strung together in an
array called a chromosome. A population of
chromosomes is created and evaluated by the
cost function, with the most fit chromosomes
being kept in the population while the least fit
ones are discarded. The chromosomes are
then paired so they can mate, involving
combining portions of each chromosome to
produce new chromosomes.
Random
mutations are imposed.
The new
chromosomes are evaluated by the cost
function and the process iterates. Thus the
parameter space is explored by a combination
of combining parts of the best solutions as well
as extending the search through mutations.
The trade-offs involved in selecting population
size, mutation rate, and mate selection are
briefly discussed below.
The key to using GAs in environmental
sciences is to pose the problem as one in
optimization.
Many problems are quite
naturally optimization problems, such as the
many uses of inverse models in environmental
science. Other problems can be manipulated
into optimization form by careful definition of
the cost function, so that even nonlinear
_____________________________________
* Corresponding author address: Sue Ellen
Haupt, Department of Mechanical and
Aerospace Engineering, 4130, Utah State
University, Logan, UT 84322-4130; e-mail:
suehaupt@ece.usu.edu
Population of
Random Bits
Natural Selection
Mating
Mutation
Convergence Check
done
Figure 1:
Algorithm
q r s t
110 000 010 001
000 110 001 101
111 000 100 111
001 011 111 000
parameters
chromosomes
Figure 3.
process.
5
4.5
4
3.5
3
2.5
number
2 of individuals
1.5
1
0.5
0
10
15
20
25
30
4. EXAMPLE APPLICATION
state space
4
dx
= ax bxy
dt
dy
= cy + dxy
dt
3.5
2.5
2
predators
1.5
(1)
0.5
1
1.5
2.5
3.5
4.5
prey
5.5
s t = Ls + C
(2)
4
3
3.5
1
2.5
-1
number of individuals
prey
predators
-2
-3
1.5
-4
10
15
20
25
number
1 of individuals
0.5
0
0
10
15
20
25
s t = Ns T s + Ls + C
(3)
30
30
0
predator
-1
-2
-3
-4
-3
-2
-1
prey
10
10
2
minimum
10 cost
REFERENCES
10
10
15
20
25
iteration
30
35
40
45
50
of precipitation occurrence,
Sciences, 46(2), pp. 255-268.
Hydrological