The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory

This paper is the first part of a two-part series. It proves a number of direct relationships between the Fourier transform and the simple genetic algorithm. (For a binary representation, the Walsh transform is the Fourier transform.) The results are of a theoretical nature and are based on the analysis of mutation and crossover. The Fourier transform of the mixing matrix is shown to be sparse. An explicit formula is given for the spectrum of the differential of the mixing transformation. By using the Fourier representation and the fast Fourier transform, one generation of the infinite population simple genetic algorithm can be computed in time O(cl log2 3), where c is arity of the alphabet and l is the string length. This is in contrast to the time of O(c3l) for the algorithm as represented in the standard basis. There are two orthogonal decompositions of population space that are invariant under mixing. The sequel to this paper will apply the basic theoretical results obtained here to inverse problems and asymptotic behavior.

[1]  David W. Lewis,et al.  Matrix theory , 1991 .

[2]  Alden H. Wright,et al.  Stability of Vertex Fixed Points and Applications , 1994, FOGA.

[3]  Alden H. Wright,et al.  Simple Genetic Algorithms with Linear Fitness , 1994, Evolutionary Computation.

[4]  Kalyanmoy Deb,et al.  Analyzing Deception in Trap Functions , 1992, FOGA.

[5]  Gunar E. Liepins,et al.  Punctuated Equilibria in Genetic Search , 1991, Complex Syst..

[6]  D. E. Goldberg,et al.  Simple Genetic Algorithms and the Minimal, Deceptive Problem , 1987 .

[7]  Michael D. Vose,et al.  The Genetic Algorithm Fractal , 1993, Evolutionary Computation.

[8]  Akiko Aizawa,et al.  Fitness Landscape Characterization by Variance of Decompositions , 1996, Foundations of Genetic Algorithms.

[9]  Michael D. Vose,et al.  Formalizing Genetic Algorithms , 1991 .

[10]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part II, Deception and Its Analysis , 1989, Complex Syst..

[11]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[12]  John J. Grefenstette,et al.  Deception Considered Harmful , 1992, FOGA.

[13]  Gary J. Koehler Diagonalizing the Simple GA Mixing Matrix , 1996, FOGA.

[14]  Michael D. Vose,et al.  A Critical Examination of the Schema Theorem , 1993 .

[15]  Albert Donally Bethke,et al.  Genetic Algorithms as Function Optimizers , 1980 .

[16]  Siddhartha Bhattacharyya,et al.  General Cardinality Genetic Algorithms , 1997, Evolutionary Computation.

[17]  G. Birkhoff,et al.  A survey of modern algebra , 1942 .

[18]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

[19]  Michael D. Vose,et al.  Modeling Simple Genetic Algorithms , 1992, FOGA.

[20]  Joost N. Kok,et al.  Tracing the Behavior of Genetic Algorithms Using Expected Values of Bit and Walsh Products , 1995, ICGA.

[21]  Garrett Birkhoff,et al.  A survey of modern algebra , 1942 .