Abstract.A simple model of genetic algorithm convergence is presented. An ``ideal'' iteration may be specified, in terms of a random variable for the weight distribution. The behavior of an ``actual'' iteration may in some cases be sufficiently close to the ideal behavior that useful quantitative information is obtained. In any case, a useful framework for analyzing a genetic algoritm is provided.

Received: January 28, 2010

AMS Subject Classification: 68W40

Key Words and Phrases: genetic algorithm convergence, iteration, ``ideal'' iteration, ``actual'' iteration

Source: International Journal of Pure and Applied Mathematics
ISSN: 1311-8080
Year: 2010
Volume: 61
Issue: 3