论文信息 - Modeling Simple Genetic Algorithms

Modeling Simple Genetic Algorithms

The infinite- and finite-population models of the simple genetic algorithm are extended and unified, The result incorporates both transient and asymptotic GA behavior. This leads to an interpretation of genetic search that partially explains population trajectories. In particular, the asymptotic behavior of the large-population simple genetic algorithm is analyzed.

Michael D. Vose | M. Vose

[1] Michael D. Vose. Computing Steady State Distributions Without Cancellation , 1993 .

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

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

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

[5] D. Chillingworth. THE GENERAL TOPOLOGY OF DYNAMICAL SYSTEMS , 1995 .

[6] Alden H. Wright,et al. Finiteness of the Fixed Point Set for the Simple Genetic Algorithm , 1995, Evolutionary Computation.

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

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