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.
This content is only available as a PDF.
© 1995 by the Massachusetts Institute of Technology
1995
You do not currently have access to this content.