[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content

Advertisement

Log in

Stochastic analysis of OneMax problem using Markov chain

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

Experimental and analytical investigations are performed for OneMax problem using Wright–Fisher model. This study investigates the distribution of the first order schema frequency in the evolution process of Genetic Algorithm (GA). Effects of mutation in GA are analyzed for the standard mutation and asymmetric mutation models. If a population is in linkage equilibrium, it can be shown that OneMax problem is equivalent to the asymmetric mutation model. Thus, we can apply theoretical results obtained in the asymmetric mutation model to OneMax problem and investigate the convergence time of GA calculation within the framework of Wright–Fisher model.

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

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Goldberg DE (1997) Lessons from genetic algorithms for the automation of design innovation and creativity. In: Bentley PJ (ed) Evolutionary design by computers. Morgan Kaufmann, San Mateo, pp 105–118

  2. Dumitrescu D, Lazzerini B (2000) Evolutionary computation. CRC Press, Boca Raton

    MATH  Google Scholar 

  3. Doerr B, Hebbinghaus N, Neumann F (2006) Speeding up evolutionary algorithms through asymmetric mutation operators. Evol Comput 15(4):401–410

    Article  Google Scholar 

  4. Furutani H, Katayama S, Sakamoto M, Ito M (2007) Stochastic analysis of schema distribution in a multiplicative landscape. Artif Life Robotics 11:101–104

    Article  Google Scholar 

  5. Ewens JWJ (2004) Mathematical population genetics. I. Theoretical introduction, 2nd edn. Springer, New York

    Book  MATH  Google Scholar 

  6. Furutani H (2003) Schema analysis of OneMax problem—evolution equation for first order schemata, foundations of genetic algorithms 7. Morgan Kaufmann, San Francisco, pp 9–26

    Google Scholar 

  7. Crow JF, Kimura M (1970) An introduction to population genetics theory. Harper and Row, New York

    MATH  Google Scholar 

  8. Tan WY (2002) Stochastic models with applications to genetics, cancers, AIDS and other biomedical systems. World Scientific, Singapore

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hiroshi Furutani.

About this article

Cite this article

Ma, Q., Zhang, Ya., Koga, K. et al. Stochastic analysis of OneMax problem using Markov chain. Artif Life Robotics 17, 395–399 (2013). https://doi.org/10.1007/s10015-012-0075-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10015-012-0075-8

Keywords

Navigation