Advertisement

On Asymptotic Behaviour of a Simple Genetic xsAlgorithm

  • Witold Kosiński
  • Stefan Kotowski
  • Jolanta Socała
Part of the Advances in Soft Computing book series (AINSC, volume 35)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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.MathSciNetGoogle Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    3. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer, Berlin, 1996.zbMATHGoogle Scholar
  4. 4.
    4. M. D. Vose, The Simple Genetic Algorithm: Foundation and Theory, MIT Press, Cambridge, MA, 1999.Google Scholar
  5. 5.
    5. A. Lasota, J. A. Yorke, Exact dynamical systems and the Frobenius-Perron operator, Trans. Amer. Math. Soc.273 (1982), 375–384.zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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.Google Scholar
  7. 7.
    7. R. Schaefer, Foundations of Genetic Global Optimization(in Polish) (Podstawy genetycznej optymalizacji globalnej), Wydawnictwo Uniwersytetu Jagieloñskiego, Kraków 2002.Google Scholar
  8. 8.
    8. R. Rudnicki, On asymptotic stability and sweeping for Markov operators, Bull. Polish Acad. Sci. Math., 43 (1995), 245–262.zbMATHMathSciNetGoogle Scholar
  9. 9.
    9. J. Socała, Asymptotic behaviour of the iterates of nonnegative operators on a Banach lattice, Ann. Polon. Math., 68 (1), (1998), 1–16.MathSciNetGoogle Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    11. J. Socała, Markovian approach to genetic algorithms, under preparation.Google Scholar
  12. 12.
    12. S. Kotowski, J. Socała, W. Kosiñski, Z. Michalewicz, Markovian model of simple genetic algorithms and its asymptotic behaviour, under preparation, 2006.Google Scholar

Copyright information

© Springer 2006

Authors and Affiliations

  • Witold Kosiński
    • 1
    • 2
  • Stefan Kotowski
    • 3
  • Jolanta Socała
    • 4
  1. 1.Research Center, Department of Intelligent SystemsPolish-Japanese Institute of Information TechnologyWarszawaPoland
  2. 2.Institute of Environmental Mechanics and Applied Computer Science Kazimierz Wielki UniversityBydgoszczPoland
  3. 3.IPPT PANInstitute of Fundamental Technological ResearchWarszawaPoland
  4. 4.Institute of MathematicsSilesian UniversityKatowicePoland

Personalised recommendations