Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
2014 Impact factor:

Evolutionary Computation

Fall 1995, Vol. 3, No. 3, Pages 299-309
(doi: 10.1162/evco.1995.3.3.299)
© 1995 by the Massachusetts Institute of Technology
Finiteness of the Fixed Point Set for the Simple Genetic Algorithm
Article PDF (599.64 KB)

The infinite population simple genetic algorithm is a discrete dynamical system model of a genetic algorithm. It is conjectured that trajectories in the model always converge to fixed points. This paper shows that an arbitrarily small perturbation of the fitness will result in a model with a finite number of fixed points. Moreover, every sufficiently small perturbation of fimess preserves the finiteness of the fixed point set. These results allow proofs and constructions that require finiteness of the fixed point set. For example, applying the stable manifold theorem to a fixed point requires the hyperbolicity of the differential of the transition map of the genetic algorithm, which requires (among other things) that the fixed point be isolated.