Skip to main content

Error Thresholds and Their Relation to Optimal Mutation Rates

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1674))

Abstract

The error threshold — a notion from molecular evolution — is the critical mutation rate beyond which structures obtained by the evolutionary process are destroyed more frequently than selection can reproduce them. We argue that this notion is closely related to the more familiar notion of optimal mutation rates in Evolutionary Algorithms (EAs). This correspondence has been intuitively perceived before ([9], [11]). However, no previous study, to our knowledge, has been aimed at explicitly testing the hypothesis of such a relationship. Here we propose a methodology for doing so. Results on a restricted range of fitness landscapes suggest that these two notions are indeed correlated. There is not, however, a critically precise optimal mutation rate but rather a range of values producing similar near-optimal performance. When recombination is used, both error thresholds and optimal mutation ranges are lower than in the asexual case. This knowledge may have both theoretical relevance in understanding EA behavior, and practical implications for setting optimal values of evolutionary parameters.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. C. Boerlijst, S. Bonhoeffer, and M. A. Nowak. Viral quasi-species and recombination. Proc. R. Soc. London. B, 263:1577–1584, 1996.

    Article  Google Scholar 

  2. K. A. DeJong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Arbor, MI, 1975.

    Google Scholar 

  3. M. Eigen. Self-organization of matter and the evolution of biological macromolecules. Naturwissenschaften, 58:465–523, 1971.

    Article  Google Scholar 

  4. M. Eigen, J. McCaskill, and P. Schuster. Molecular quasi-species. J. Phys. Chem., 92:6881–6891, 1988.

    Article  Google Scholar 

  5. M. Eigen and P. Schuster. The Hypercycle: A Principle of Natural Self-Organization. Springer-Verlag, 1979.

    Google Scholar 

  6. J. Grefenstette. Optimisation of control parameters for genetic algorithms. IEE Trans SMC, 16(1):122–128, 1986.

    Google Scholar 

  7. I. Harvey, P. Husbands, D. Cliff, A. Thompson, and N. Jakobi. Evolutionary robotics: the Sussex approach. Robotics and Autonomous Systems, 20:205–224, 1997.

    Article  Google Scholar 

  8. I. Harvey and A. Thompson. Through the labyrinth evolution finds a way: A silicon ridge. In Proc. of The First International Conference on Evolvable Systems: From Biology to Hardware (ICES96). Springer-Verlag, 1996.

    Google Scholar 

  9. J. Hesser and R. Männer. Towards an optimal mutation probability for genetic algorithms. In H.-P. Schwefel and R. Manner, editors, Parallel Problem Solving from Nature. Springer-Verlag, Lecture Notes in Computer Science Vol. 496, 1991.

    Google Scholar 

  10. M.A. Huynen. Exploring phenotype space through neutral evolution. Technical Report Preprint 95-10-100, Santa Fe Institute, 1995.

    Google Scholar 

  11. S. A. Kauffman. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, 1993.

    Google Scholar 

  12. J. Maynard Smith. Natural selection and the concept of a protein space. Nature, 225:563–564, 1970.

    Article  Google Scholar 

  13. M. Mitchell, S. Forrest, and J. H. Holland. The Royal Road for genetic algorithms: fitness landscapes and GA performance. In F. J. Varela and P. Bourgine, editors, Proceedings of the First European Conference on Artificial Life. Toward a Practice of Autonomous Systems, pages 245–254. MIT Press, Cambridge, MA, 1992.

    Google Scholar 

  14. M. Nowak and P. Schuster. Error thresholds of replication in finite populations: Mutation frequencies and the onset of Muller’s ratchet. J. Theor. Biol., 137:375–395, 1989.

    Article  Google Scholar 

  15. G. Ochoa and I. Harvey. Recombination and error thresholds in finite populations. In W. Banzhaf and C. Reeves, editors, Foundations of Genetic Algorithms (FOGA-5). Morgan Kauffman, 1998.

    Google Scholar 

  16. G. Ochoa, I. Harvey, and H. Buxton. On recombination and optimal mutation rates. In Proceedings of Genetic and Evolutionary Computation Conference (GECCO-99), 1999. To appear.

    Google Scholar 

  17. J.D. Schaffer, R.A. Caruana, L.J. Eshelman, and R. Das. A study of control parameters affecting online performance of genetic algorithms for function optimization. In J. D. Schaffer, editor, Proceedings of the 3rd ICGA. Morgan Kaufmann, 1989.

    Google Scholar 

  18. P. Schuster. Extended molecular evolutionary biology: Artificial life bridging the gap between chemestry and biology. Artificial Life, 1:39–60, 1994.

    Article  Google Scholar 

  19. E. van Nimwegen and J. P. Crutchfield. Optimizing epochal evolutionary search: Population-size dependent theory. Technical Report Preprint 98-10-090, Santa Fe Institute, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ochoa, G., Harvey, I., Buxton, H. (1999). Error Thresholds and Their Relation to Optimal Mutation Rates. In: Floreano, D., Nicoud, JD., Mondada, F. (eds) Advances in Artificial Life. ECAL 1999. Lecture Notes in Computer Science(), vol 1674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48304-7_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-48304-7_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66452-9

  • Online ISBN: 978-3-540-48304-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics