Bistability in a Gene Pool GA with Mutation

It is possible for a GA to have two stable fixed points on a single-peak fitness landscape. These can correspond to meta-stable finite populations. This phenomenon is called bistability, and is only known to happen in the presence of recombination, selection, and mutation. This paper models the bistability phenomenon using an infinite population model of a GA based on gene pool recombination. Fixed points and their stability are explicitly calculated. This is possible since the infinite population model of the gene pool GA is much more tractable than the infinite population model for the standard simple GA. For the needle-in-the-haystack fitness function, the fixed point equations reduce to a single variable polynomial equation, and stability of fixed points can be determined from the derivative of the single variable equation. We also show empirically that bistability can occur on a single-peak landscape where there is selective pressure toward the optimum at every point of the search space. ∗ This paper was written while Alden Wright was visiting the School of Computer Science, University of Birmingham, UK.

[1]  M. Nowak,et al.  Error thresholds of replication in finite populations mutation frequencies and the onset of Muller's ratchet. , 1989, Journal of theoretical biology.

[2]  Jonathan E. Rowe,et al.  Population Fixed-Points for Functions of Unitation , 1998, FOGA.

[3]  James R. Neil,et al.  Analysis of the simple genetic algorithm on the single-peak and double-peak landscapes , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[4]  Suzuki,et al.  ERRATA: Crossover Accelerates Evolution in GAs with a Babel-like Fitness Landscape: Mathematical Analysis. , 2000, Evolutionary computation.

[5]  Alden H. Wright,et al.  The Simple Genetic Algorithm and the Walsh Transform: Part II, The Inverse , 1998, Evolutionary Computation.

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

[7]  M. Nowak,et al.  Viral quasi-species and recombination , 1996, Proceedings of the Royal Society of London. Series B: Biological Sciences.

[8]  H. Geiringer On the Probability Theory of Linkage in Mendelian Heredity , 1944 .

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

[10]  Hiroshi Furutani,et al.  Study of crossover in One Max problem by linkage analysis , 2001 .

[11]  Alden H. Wright,et al.  The Simple Genetic Algorithm and the Walsh Transform: Part I, Theory , 1998, Evolutionary Computation.

[12]  Gilbert Syswerda,et al.  Simulated Crossover in Genetic Algorithms , 1992, FOGA.

[13]  A. Prügel-Bennett,et al.  Modelling genetic algorithm dynamics , 2001 .

[14]  Alden H. Wright,et al.  A Fixed Point Analysis Of A Gene Pool GA With Mutation , 2002, GECCO.

[15]  M. Eigen,et al.  Molecular quasi-species. , 1988 .

[16]  Inman Harvey,et al.  Recombination and Error Thresholds in Finite Populations , 1998, FOGA.

[17]  Hideaki Suzuki,et al.  Crossover Accelerates Evolution in GAs with a Babel-like Fitness Landscape: Mathematical Analyses , 1999, Evolutionary Computation.

[18]  Rich Caruana,et al.  Removing the Genetics from the Standard Genetic Algorithm , 1995, ICML.

[19]  T. Mahnig,et al.  Evolutionary algorithms: from recombination to search distributions , 2001 .