Computable rate of convergence in evolutionary computation

The broad field of evolutionary computation (EC)-including genetic algorithms as a special case-has attracted much attention in the last several decades. Many bold claims have been made about the effectiveness of various EC algorithms. These claims have centered on the efficiency, robustness, and ease of implementation of EC approaches. Unfortunately, there seems to be little theory to support such claims. One key step to formally evaluating or substantiating such claims is to establish rigorous results on the rate of convergence of EC algorithms. This paper presents a computable rate of convergence for a class of ECs that includes the standard genetic algorithm as a special case.

[1]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[2]  J. Kingman.  FINITE MARKOV PROCESSES AND THEIR APPLICATIONS , 1981 .

[3]  A. E. Eiben,et al.  Global Convergence of Genetic Algorithms: A Markov Chain Analysis , 1990, PPSN.

[4]  Gunar E. Liepins,et al.  Punctuated Equilibria in Genetic Search , 1991, Complex Syst..

[5]  José Carlos Príncipe,et al.  A Markov Chain Framework for the Simple Genetic Algorithm , 1993, Evolutionary Computation.

[6]  Günter Rudolph,et al.  Convergence analysis of canonical genetic algorithms , 1994, IEEE Trans. Neural Networks.

[7]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: On the Benefits of Sex the (/, ) Theory , 1995, Evolutionary Computation.

[8]  Hans-Paul Schwefel,et al.  Evolution and optimum seeking , 1995, Sixth-generation computer technology series.

[9]  Joe Suzuki,et al.  A Markov chain analysis on simple genetic algorithms , 1995, IEEE Trans. Syst. Man Cybern..

[10]  Michael D. Vose.  Logarithmic Convergence of Random Heuristic Search , 1996, Evolutionary Computation.

[11]  Günter Rudolph,et al.  Convergence of evolutionary algorithms in general search spaces , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[12]  G. Unter Rudolph.  Convergence Rates of Evolutionary Algorithms for a Class of Convex Objective Functions , 1997 .

[13]  Günter Rudolph,et al.  Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon , 1998, Fundam. Informaticae.

[14]  Gian Luigi Ferrari,et al.  Parameterized Structured Operational Semantics , 1998, Fundam. Informaticae.

[15]  M. Vose.  The Simple Genetic Algorithm , 1999 .

[16]  J. Spall,et al.  Some theoretical comparisons of stochastic optimization approaches , 2000, Proceedings of the 2000 American Control Conference. ACC (IEEE Cat. No.00CH36334).

[17]  Chak-Kuen Wong,et al.  A new model of simulated evolutionary computation-convergence analysis and specifications , 2001, IEEE Trans. Evol. Comput..