Theoretical Analysis of Genetic Algorithms with Infinite Population Size
Stefan Voget
Institut für Mathematik, Universität Hildesheim,
Marienburger Platz 22,
D-31141 Hildesheim, Germany
Abstract
A genetic algorithm (GA) is a stochastic search and optimization algorithm that works by iterative application of several evolutionary operators. An approximation model is presented for the algorithm with the population size set to infinity. Results are given for the repeated, isolated application of the operators selection, crossover, and mutation. The speed of convergence to a limit distribution is examined. These examinations extend results of previous published results of GAs with an infinite population size.
