Abstract
For a general Markov chain model of genetic algorithm, we establish an upper bound for the number of iterations which must be executed in order to generate, with a prescribed probability, a population consisting entirely of minimal solutions to a multiobjective optimization problem. However, since populations may contain multiple copies of the same element, we can only guarantee that at least one minimal solution is found. Using this upper bound, we then derive a stopping criterion which ensures that at least one minimal element is a member of the last population generated.
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.
References
Greenhalgh, D., Marshall, S.: Convergence Criteria for Genetic Algorithms. SIAM J. Comput. 30, 269–282 (2000)
Jakubowski, J., Sztencel, R.: Introduction to Probability Theory. Script, Warszawa (2001) (in Polish)
Koehler, G.J., Bhattacharya, S., Vose, M.D.: General Cardinality Genetic Algorithms. Evol. Comput. 5, 439–459 (1998)
Reeves, C.R., Rowe, J.E.: Genetic Algorithms — Principles and Perspectives: A Guide to GA Theory. Kluwer, Boston (2003)
Rudolph, G., Agapie, A.: Convergence Properties of Some Multi-objective Evolutionary Algorithms. In: Zalzala, A., et al. (eds.) Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), vol. 2, pp. 1010–1016. IEEE Press, Piscataway (2000)
Studniarski, M.: Stopping Criteria for a General Model of Genetic Algorithm. In: Twelfth National Conference on Evolutionary Computation and Global Optimization, Zawoja, Poland, pp. 173–181 (2009)
Vose, M.D.: The Simple Genetic Algorithm: Foundations and Theory. MIT Press, Cambridge (1999)
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
Studniarski, M. (2010). Stopping Criteria for Genetic Algorithms with Application to Multiobjective Optimization. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds) Parallel Problem Solving from Nature, PPSN XI. PPSN 2010. Lecture Notes in Computer Science, vol 6238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15844-5_70
Download citation
DOI: https://doi.org/10.1007/978-3-642-15844-5_70
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15843-8
Online ISBN: 978-3-642-15844-5
eBook Packages: Computer ScienceComputer Science (R0)