Abstract
The simple genetic algorithm (SGA) and its convergence analysis are main subjects of the article. The SGA is defined on a finite multi-set of potential problem solutions (individuals) together with random mutation and selection operators. The selection operation acts on the basis of the fitness function defined on potential solutions (individuals), and is fundamental for the problem considered. Generation of a new population from the given one, is realized by the iterative actions of those operators. Each iteration is written in the form of a transition operator acting on probability vectors which describe probability distributions of each population. The transition operator is a Markov one. Thanks to the well-developed theory of Markov operators [5,8,9] new conditions for stability of the transition operator are formulated. The obtained results are related to the class of genetic operators and are not restricted to binary operators.
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
1. A. Lasota, Asymptotic properties of semigroups of Markov operators (in Polish), Matematyka Stosowana. Matematyka dla Spoęzeñstwa, PTM, Warszawa, 3(45), 2002, 39–51.
2. P. Kieœ i Z. Michalewicz, Foundations of genetic algorithms (in Polish), Matematyka Stosowana. Matematyka dla Spoęzeñstwa, PTMWarszawa 1(44), 2000, 68–91.
3. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1996.
4. M. D. Vose, The Simple Genetic Algorithm: Foundation and Theory, MIT Press, Cambridge, MA, 1999.
5. A. Lasota, J. A. Yorke, Exact dynamical systems and the Frobenius-Perron operator, Trans. Amer. Math. Soc.273 (1982), 375–384.
6. J. E. Rowe, The dynamical system models of the simple genetic algorithm, in Theoretical Aspects of Evolutionary Computing, Leila Kallel, Bart Naudts, Alex Rogers (Eds.), Springer, 2001, pp. 31–57.
7. R. Schaefer, Foundations of Genetic Global Optimization(in Polish) (Podstawy genetycznej optymalizacji globalnej), Wydawnictwo Uniwersytetu Jagieloñskiego, Kraków 2002.
8. R. Rudnicki, On asymptotic stability and sweeping for Markov operators, Bull. Polish Acad. Sci. Math., 43 (1995), 245–262.
9. J. Socała, Asymptotic behaviour of the iterates of nonnegative operators on a Banach lattice, Ann. Polon. Math., 68 (1), (1998), 1–16.
10. J. Socała, W. Kosiñski, S. Kotowski, On asymptotic behaviour of a simple genetic algorithm (in Polish), Matematyka Stosowana. Matematyka dla Spoęzeñstwa, PTM, Warszawa,6 (47), 2005, 70–86.
11. J. Socała, Markovian approach to genetic algorithms, under preparation.
12. S. Kotowski, J. Socała, W. Kosiñski, Z. Michalewicz, Markovian model of simple genetic algorithms and its asymptotic behaviour, under preparation, 2006.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Kosiński, W., Kotowski, S., Socała, J. (2006). On Asymptotic Behaviour of a Simple Genetic xsAlgorithm. In: Kłopotek, M.A., Wierzchoń, S.T., Trojanowski, K. (eds) Intelligent Information Processing and Web Mining. Advances in Soft Computing, vol 35. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-33521-8_6
Download citation
DOI: https://doi.org/10.1007/3-540-33521-8_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33520-7
Online ISBN: 978-3-540-33521-4
eBook Packages: EngineeringEngineering (R0)