An Analysis About the Asymptotic Convergence of Evolutionary Algorithms

Authors:
Lixin Ding;Jinghu Yu
Affiliations:
State Key Lab of Software Engineering, Wuhan University, Wuhan 430072, China;Department of Mathematics, School of Natural Sciences, Wuhan University of Technology, Wuhan 430070, China
Venue:
Computational Intelligence and Security
Year:
2007

Citing 8
Cited 0

Genetic algorithms: bridging the convergence gap

Theoretical Computer Science - Special issue on evolutionary computation
On the convergence rates of genetic algorithms

Theoretical Computer Science - Special issue on evolutionary computation
Theory of genetic algorithms

Theoretical Computer Science
The Simple Genetic Algorithm: Foundations and Theory

The Simple Genetic Algorithm: Foundations and Theory
Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover

Genetic Programming and Evolvable Machines
Theoretical Analysis of Mutation-Adaptive Evolutionary Algorithms

Evolutionary Computation
Schema theory for genetic programming with one-point crossover and point mutation

Evolutionary Computation
A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the asymptotic convergence of evolutionary algorithms based on finite search space by using the properties of Markov chains and Perron-Frobenius Theorem. First, some convergence results of general square matrices are given. Then, some useful properties of homogeneous Markov chains with finite states are investigated. Finally, the geometric convergence rates of the transition operators, which is determined by the revised spectral of the corresponding transition matrix of a Markov chain associated with the EA considered here, are estimated by combining the acquired results in this paper.