Modeling simple genetic algorithms

  • Authors:
  • Michael D. Vose

  • Affiliations:
  • Department of Computer Science 107 Ayres Hall The University of Tennessee Knoxville, TN 37996-1301 vose@cs.utk.edu

  • Venue:
  • Evolutionary Computation
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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.