Skip to main content

Quasi-Stability of Real Coded Finite Populations

  • Conference paper
Parallel Problem Solving from Nature – PPSN XIII (PPSN 2014)

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

Included in the following conference series:

Abstract

This contribution analyzes dynamics of mean and variance of real chromosomes in consecutive populations of an Evolutionary Algorithm with selection and mutation. Quasi-stable state is characterized with an area in which population mean and variance will remain roughly unchanged for many generations. Size of the area can be indirectly estimated from the infinite population analysis and is influenced by the population size, selection type and parameter, and the mutation variance. The paper gives formulas that define this influence and illustrates them with numerical examples.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

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. Arabas, J.: Approximating the genetic diversity of populations in the quasi-equilibrium state. IEEE Transactions on Evolutionary Computation 16(5), 632–644 (2012)

    Article  Google Scholar 

  2. Beyer, H.G., Deb, K.: On self-adaptive features in real-parameter evolutionary algorithms. IEEE Transactions on Evolutionary Computation 5(3), 250–270 (2001)

    Article  Google Scholar 

  3. Arnold, D.V., Beyer, H.G.: On the benefits of populations for noisy optimization. Evolutionary Computation 11(2), 111–127 (2003)

    Article  Google Scholar 

  4. Arnold, D.V.: Noisy Optimization with Evolution Strategies. Kluwer Academic Publishers (2002)

    Google Scholar 

  5. Qi, X., Palmieri, F.: Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space part I: Basic properties of selection and mutation. IEEE Transactions on Neural Networks 5(1), 102–119 (1994)

    Article  Google Scholar 

  6. Karcz-Dulęba, I.: Dynamics of infinite populations evolving in a landscape of uni and bimodal fitness functions. IEEE Transactions on Evolutionary Computation 5(4), 398–409 (2001)

    Article  Google Scholar 

  7. Muehlenbein, H., Schlierkamp-Voosen, D.: Predictive models for the Breeder Genetic Algorithm – I. continuous parameter optimization. Evolutionary Computation 1, 25–49 (1993)

    Article  Google Scholar 

  8. Chorazyczewski, A., Galar, R.: Visualization of evolutionary adaptation in R n. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 659–668. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  9. Wilke, C., et al.: Evolution of digital organisms at high mutation rates leads to survival of the flattest. Nature 412(6844), 331–333 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Arabas, J., Biedrzycki, R. (2014). Quasi-Stability of Real Coded Finite Populations. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_86

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10762-2_86

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10761-5

  • Online ISBN: 978-3-319-10762-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics