Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37

Evolutionary Computation

Fall 1998, Vol. 6, No. 3, Pages 275-289
(doi: 10.1162/evco.1998.6.3.275)
© 1998 by the Massachusetts Institute of Technology
The Simple Genetic Algorithm and the Walsh Transform: Part II, The Inverse
Article PDF (677.83 KB)
Abstract

This paper continues the development, begun in Part I, of the relationship between the simple genetic algorithm and the Walsh transform. The mixing scheme (comprised of crossover and mutation) is essentially “triangularized” when expressed in terms of the Walsh basis. This leads to a formulation of the inverse of the expected next generation operator. The fixed points of the mixing scheme are also determined, and a formula is obtained giving the fixed point corresponding to any starting population. Geiringer's theorem follows from these results in the special case corresponding to zero mutation.