Skip to main content

Part of the book series: Natural Computing Series ((NCS))

Abstract

In this chapter we present evolutionary programming (EP), another historical member of the EC family. Other EC streams have an algorithm variant that can be identified as being the “standard”, or typical, version of genetic algorithms, evolution strategies, or genetic programming. For EP such a standard version is hard to define for reasons discussed later in this chapter. The summary of EP in Table 5.1 is therefore a representative rather than a standard algorithm variant.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. L.J. Fogel, A.J. Owens, M.J. Walsh. Artificial Intelligence through Simulated Evolution. John Wiley, 1966

    MATH  Google Scholar 

  2. D.B. Fogel. Evolutionary Computation. IEEE Press, Piscataway, NJ, 1995

    Google Scholar 

  3. T. Bäck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996

    MATH  Google Scholar 

  4. T. Bäck, D.B. Fogel, Z. Michalewicz, Eds. Evolutionary Computation 1: Basic Algorithms and Operators. Institute of Physics Publishing, Bristol, 2000

    Google Scholar 

  5. T. Bäck, D.B. Fogel, Z. Michalewicz, Eds. Evolutionary Computation 2: Advanced Algorithms and Operators. Institute of Physics Publishing, Bristol, 2000

    Google Scholar 

  6. T. Bäck, G. Rudolph, H.-P. Schwefel. Evolutionary programming and evolution strategies: Similarities and differences. In Fogel, Atmar Eds. [151], pp. 11–22

    Google Scholar 

  7. D.K. Gehlhaar, D.B. Fogel. Tuning evolutionary programming for confor-mationally flexible molecular docking. In Fogel et al. [154], pp. 419–429. Seminal paper comparing different EP variants and different approaches to self-adaptation

    Google Scholar 

  8. D.B. Fogel. Blondie 24: Playing at the Edge of AI. Morgan Kaufmann, San Francisco, 2002. The following papers form a good starting point for readers interested in the crossover versus mutation debate.

    Google Scholar 

  9. David B. Fogel and J. W. Atmar. Comparing genetic operators with Gaussian mutations in simulated evolutionary processes using linear Systems. Biological Cybernetics, 63(2):111–114, 1990

    Article  Google Scholar 

  10. W.M. Spears. Crossover or mutation. In Whitley [420], pp. 220–237

    Google Scholar 

  11. Larry J. Eshelman and J. David Schaffer. Crossover’s niche. In Forrest [158], pp. 9–14

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Eiben, A.E., Smith, J.E. (2003). Evolutionary Programming. In: Introduction to Evolutionary Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-05094-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-05094-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-07285-7

  • Online ISBN: 978-3-662-05094-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics