Skip to main content
SpringerLink
Log in

An Examination of Hypermutation and Random Immigrant Variants of mrCGA for Dynamic Environments

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2723))

Included in the following conference series:

4 Conclusions

Our results show that for the single-leg locomotion problem, hypermutation increases the quality of the mrCGA’s solution in a dynamic environment, whereas the random immigrant variant produces slightly lower scores. Both of these variants can be easily added to the existing mrCGA hardware implementation without significantly increasing its complexity. In the future we plan to categorize the effects of the hypermutation and random immigrant strategies on the mrCGA for a variety of generalized benchmarks. This categorization will be useful to help determine which dynamic optimization strategy should be employed for a given problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Cobb, H.G. (1990) An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments. Technical Report AIC-90-001, Naval Research Laboratory, Washington, USA.

    Google Scholar 

  2. Gallagher, J.C. & Vigraham, S. (2002) A Modified Compact Genetic Algorithm for the Intrinsic Evolution of Continuous Time Recurrent Neural Networks. The Proceedings of the 2002 Genetic and Evolutionary Computation Conference. Morgan-Kaufmann.

    Google Scholar 

  3. Gallagher, J.C., Vigraham, S., & Kramer, G.R. (2002) A Family of Compact Genetic Algorithms for Intrinsic Evolvable Hardware.

    Google Scholar 

  4. Grefenstette, J.J. (1992) Genetic algorithms for changing environments. In R. Maenner and B. Manderick, editors, Parallel Problem Solving from Nature 2, pages 137–144. North Holland.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Wright State University, Dayton, OH, 45435-0001

    Gregory R. Kramer & John C. Gallagher

Authors
  1. Gregory R. Kramer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. John C. Gallagher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Lawrence Livermore National Laboratory, Center for Applied Scientific Computing (CASC), 7000 East Avenue, L-561, Livermore, CA, 94550, USA

    Erick Cantú-Paz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kramer, G.R., Gallagher, J.C. (2003). An Examination of Hypermutation and Random Immigrant Variants of mrCGA for Dynamic Environments. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2723. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45105-6_56

Download citation

  • DOI: https://doi.org/10.1007/3-540-45105-6_56

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40602-0

  • Online ISBN: 978-3-540-45105-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation