Title
The simple genetic algorithm and the walsh transform: Part ii, the inverse
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.
Year
DOI
Venue
1998
10.1162/evco.1998.6.3.275
Evolutionary Computation
Keywords
Field
DocType
fourier transform,heuristic search,walsh transform
Discrete mathematics,Population,Mathematical optimization,Crossover,Walsh matrix,Fourier transform,Fixed point,S transform,Hadamard transform,Genetic algorithm,Mathematics
Journal
Volume
Issue
ISSN
6
3
1063-6560
Citations 
PageRank 
References 
19
1.54
5
Authors
2
Name
Order
Citations
PageRank
Michael D. Vose1752215.67
Alden H. Wright233045.58