Conditions for the convergence of evolutionary algorithms
This paper presents a theoretical analysis of the convergence conditions for evolutionary algorithms. The necessary and sufficient conditions, necessary conditions, and sufficient conditions for the convergence of evolutionary algorithms to the global optima are derived, which describe their limiting behaviors. Their relationships are explored. Upper and lower bounds of the convergence rates of the evolutionary algorithms are given. (C) 2001 Elsevier Science B.V. All rights reserved.
convergence evolutionary algorithms convergence rate markov chain