Evolutionary Computation
Winter 1995, Vol. 3, No. 4, Pages 453-472
(doi: 10.1162/evco.1995.3.4.453)
Modeling Simple Genetic Algorithms
Article PDF (1.05 MB)
Abstract
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.