Skip to main content

Analysis of a Genetic Model with Finite Populations

  • Conference paper
Advances in Natural Computation (ICNC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Included in the following conference series:

  • 2098 Accesses

Abstract

Simple genetic algorithms on populations of l-binary words usually become iterative systems on 2l dimensional spaces when populations have size infinite. However, in a particular model (BCCG model) previously introduced, it has been shown that the iterative system works in a l-dimensional space.

In this paper we propose a simplification of the BCCG model and we analyze it in the case of large but finite-size populations. In particular:

  1. 1

    We exhibit a Markov chain with states in ℝl that approximates the system behavior.

  2. 2

    We estimate the steady state distribution of the Markov chain.

Partially supported by the PRIN Project “Formal languages and automata: methods, models and applications”, MIUR.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goldberg, D.E.: Genetic Algorithms in Search. Addison-Wesley Publishing Company, Reading (1989)

    MATH  Google Scholar 

  2. Holland, J.H.: Induction, Processes of Inference, Learning and Discovery. MIT Press, Cambridge (1989)

    Google Scholar 

  3. Holland, J.H.: Adaptation in Natural and Artificial Systems. MIT Press, Cambridge (1992)

    Google Scholar 

  4. Koza, J.R.: Genetic Programming. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  5. Vose, M.D.: The Simple Genetic Algorithms. MIT Press, Cambridge (1999)

    Google Scholar 

  6. Tan, K.C., Lim, M.H., Yao, X., Wang, L. (eds.): Recent Advances in Simulated Evolution and Learning. Advances in Natural Computation, vol. 2. World Scientific, Singapore (2004)

    MATH  Google Scholar 

  7. Eiben, A.E., Aarts, E.H.L., van Hee, K.M.: Global convergence of genetic algorithms: A markov chain analysis. In: Schwefel, H.-P., Männer, R. (eds.) PPSN 1990. LNCS, vol. 496, pp. 4–12. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  8. Goldberg, D.E., Segrest, P.: Finite markov chain analysis of genetic algorithms. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pp. 1–8. Lawrence Erlbaum Associates, Inc., Mahwah (1987)

    Google Scholar 

  9. Nix, A.E., Vose, M.D.: Modeling genetic algorithms with markov chains. Ann. Math. Artif. Intell. 5, 77–88 (1992)

    Article  MathSciNet  Google Scholar 

  10. Vose, M.D.: Modeling simple genetic algorithms. Evolutionary Computation 3, 453–472 (1995)

    Article  Google Scholar 

  11. Bertoni, A., Campadelli, P., Carpentieri, M., Grossi, G.: A Genetic Model: Analysis and Application to MAXSAT. Evolutionary Computation 8, 291–309 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertoni, A., Campadelli, P., Posenato, R. (2005). Analysis of a Genetic Model with Finite Populations. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_28

Download citation

  • DOI: https://doi.org/10.1007/11539902_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics