More Information
Quarterly (spring, summer, fall, winter)
176 pp. per issue
7 x 10
ISSN
1063-6560
E-ISSN
1530-9304
2014 Impact factor:
2.37
List of All Issues » Issue TOC

Evolutionary Computation

Winter 1995, Vol. 3, No. 4, Pages 453-472
(doi: 10.1162/evco.1995.3.4.453)
© 1995 by the Massachusetts Institute of Technology
Modeling Simple Genetic Algorithms
Article PDF (1.05 MB)
Michael D. Vose
Department of Computer Science 107 Ayres Hall The University of Tennessee Knoxville, TN 37996-1301 vose@cs.utk.edu
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.