Skip to main content
SpringerLink
Log in

Direct replacement: A Genetic Algorithm without mutation which avoids deception

  • Conference paper
  • First Online:
Progress in Evolutionary Computation (EvoWorkshops 1993, EvoWorkshops 1994)

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

Abstract

A Genetic Algorithm is introduced in which parents are replaced by their offspring. This ensures there is no loss of alleles in the population, and hence mutation is unnecessary. Moreover, the preservation of less fit alleles in some members of the population allows the GA to avoid falling into deceptive traps.

This work was funded under SERC grant number GR/J14301.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Back, T. (1993). Optimal Mutation Rates in Genetic Search. In S. Forrest (Ed.), Fifth International Conference on Genetic Algorithms, (pp. 2–8). University of Illinois at Urbana-Champaign: Morgan Kaufmann.

    Google Scholar 

  • Culberson, J. C. (1993). Crossover versus Mutation: Fueling the Debate: TGA versus GIGA. In S. Forrest (Ed.), Fifth International Conference on Genetic Algorithms, (p. 632). University of Illinois at Urbana-Champaign: Morgan Kauffman Publishers, Inc.

    Google Scholar 

  • Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley.

    Google Scholar 

  • Goldberg, D. E., Deb, K., Kargupta, H., & Harik, G. (1993). Rapid, Accurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms. In S. Forrest (Ed.), Fifth International Conference on Genetic Algorithms, (pp. 56–64). University of Illinois at Urbana-Champaign: Morgan Kaufmann.

    Google Scholar 

  • Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.

    Google Scholar 

  • Radcliffe, N. (1991). Forma Analysis and Random Respectful Recombination. In R. K. Belew & L. B. Booker (Eds.), Fourth International Conference on Genetic Algorithms, (pp. 222–229). University of California, San Diego: Morgan Kaufmann.

    Google Scholar 

  • Schaffer, J. D., & Eshelman, L. J. (1991). On Crossover as an Evolutionary Viable Strategy. In R. K. Belew & L. B. Booker (Eds.), Fourth International Conference on Genetic Algorithms, (pp. 61–68). University of California, San Diego: Morgan Kauffman.

    Google Scholar 

  • Spears, W. M. (1992). Crossover or Mutation? In L. D. Whitley (Ed.), Foundations of Genetic Algorithms 2, (pp. 221–237). Vail, Colorado: Morgan Kaufmann.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Buckingham, MK18 1EG, Buckingham, England

    Jon Rowe & Ian East

Authors
  1. Jon Rowe
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ian East
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Xin Yao

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rowe, J., East, I. (1995). Direct replacement: A Genetic Algorithm without mutation which avoids deception. In: Yao, X. (eds) Progress in Evolutionary Computation. EvoWorkshops EvoWorkshops 1993 1994. Lecture Notes in Computer Science, vol 956. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60154-6_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-60154-6_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60154-8

  • Online ISBN: 978-3-540-49528-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation