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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Agapie, A.: Theoretical analysis of mutation-adaptive evolutionary algorithms. Evolutionary Computation 9, 127–146 (2001)
Cerf, R.: Asympototic Convergence of Genetic Algorithms. Advances in Applied Probablity 30, 521–550 (1998)
He, J., Kang, L.: On the convergence rate of genetic algorithms. Theoretical Computer Science 229, 23–39 (1999)
Lozano, J.A., et al.: Genetic algorithms: bridging the convergence gap. Theoretical Computer Science 229, 11–22 (1999)
Nix, A.E., Vose, D.E.: Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence 5, 79–88 (1992)
Poli, R., Langdon, M.: Schema theory for genetic programming with one-point crossover and point mutation. Evolutionary Computation 6, 231–252 (1998)
Poli, R.: Exact schema theory for genetic programming variable-length genetic algorithms with one-point crossover. Genetic Programming and Evolvable Machines 2, 123–163 (2001)
Rudolph, G.: Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5, 96–101 (1994)
Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. Kovac, Hamburg (1997)
Schmitt, L.M.: Theory of genetic algorithms. Theoretical Computer Science 259, 1–61 (2001)
Suzuki, J.: A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy. Man and Cybernetics-Part B 28, 95–102 (1998)
Vose, D.: The Simple Genetic Algorithms: Foundations and Theory. MIT Press, Cambridge (1999)
Steward, G.W.: Introduction to Matrix Computation. Academic Press, New York (1973)
Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability, 3rd edn. Springer-Verlag, New York (1996)
Isoifescu, M.: Finite Markov Processes and Their Applications. Wiley, Chichester (1980)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, L., Yu, J. (2007). An Analysis About the Asymptotic Convergence of Evolutionary Algorithms. In: Wang, Y., Cheung, Ym., Liu, H. (eds) Computational Intelligence and Security. CIS 2006. Lecture Notes in Computer Science(), vol 4456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74377-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-74377-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74376-7
Online ISBN: 978-3-540-74377-4
eBook Packages: Computer ScienceComputer Science (R0)