Convergence Analysis of Canonical Genetic Algorithms

  • Rudolph G
  • 138


    Mendeley users who have this article in their library.
  • 1.0k


    Citations of this article.


This paper analyzes the convergence properties of the canonical genetic algorithm (CGA) with mutation, crossover and proportional reproduction applied to static optimization problems. It is proved by means of homogeneous finite Markov chain analysis that a CGA will never converge to the global optimum regardless of the initialization, crossover, operator and objective function. But variants of CGA's that always maintain the best solution in the population, either before or after selection, are shown to converge to the global optimum due to the irreducibility property of the underlying original nonconvergent CGA. These results are discussed with respect to the schema theorem

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Günter Rudolph

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free