Abstract
There have been many results on convergence of evolutionary algorithm (EA) since it was proposed, but few result focused on convergence analysis based on relation theory. This paper proposed a relation-based model to study the equivalence and ordering of EA in convergence. The equivalence relation named equivalence in status (EIS) can be used to divide a given set of EAs into equivalence classes in which the EAs have the same capacity of convergence. EAs belonging to different EIS classes have different capacities of convergence based on the absorbing Markov chain model, which is described as an ordering relation named superiority in status. The performance of an EA can be improved if it is modified to be superior in status to its original version.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Yao, X., Xu, Y.: Recent Advances in Evolutionary Computation. Journal of Computer Science & Technology 21(1), 1–18 (2006)
Holland, J.H.: Adaptation in Natural and Artificial Systems, 1st edn. (1975), 2nd edn. MIT press, Cambridge (1992)
Goldberg, D.E.: Simple Genetic Algorithms and the Minimal Deceptive Problem. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, London Pitman, pp. 74–78 (1987)
Bethke, A.D.: Comparison of Genetic Algorithms and Gradient-Vased Optimizers on Parallel Processors: Efficiency of Use of Processing Capacity Technical Report No.197, University of Michigen, Login of Computers Group, Ann Arbor (1976)
Grefenstette, J.J.: Deception considered harmful. In: Whitley, L.D. (ed.) Foundations of Genetic Algorithms, vol. 2, pp. 75–91. Morgan Kaufmann, San Mateo (1993)
Rudolph, G.: Convergence Properties of Evolutionary Algorithms. Verlag Dr. KovaYc, Hamburg (1997)
Goldberg, D.E., Segrest, P.: Finite Markov Chain Analysis of Genetic Algorithm. In: Genetic Algorithms and Their pplication: Proceeding of the Second International Conference on Genetic Algorithms, pp. 7–8 (1987)
Eiben, A.E., Aarts, E.H., Van Hee, K.M.: Global Convergence of Genetic Algorithms: An infinite Markov Chain Analysis. In: Schwefel, H.P. (ed.) Parallel Problem Solving from Nature, pp. 4–12. Springer, Heidelberg (1991)
Rudolph, G.: Convergence Properties of Canonical Genetic Algorithms. IEEE Transaction on Neural Networks 5(1), 96–101 (1994)
He, J., Yu, X.H.: Conditions for the convergence of evolutionary algorithms. Journal of System Architecture 47, 601–612 (2001)
Iosifescu, M.: Finite Markov Processes and Their Applications. Willey, Chichester (1980)
He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127(1), 57–85 (2001)
Yu, Y., Zhou, Z.H.: A new approach to estimating the expected first hitting time of evolutionary algorithms. Artificial Intelligence 172, 1809–1832 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hao, ZF., Huang, H., Li, H., Ling, S., Li, B. (2010). A Relation-Based Model for Convergence Analysis of Evolutionary Algorithm. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2010. Lecture Notes in Computer Science, vol 6466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17563-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-17563-3_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17562-6
Online ISBN: 978-3-642-17563-3
eBook Packages: Computer ScienceComputer Science (R0)