Skip to main content

Mechanisms for Evolutionary Reincarnation

  • Conference paper

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

Abstract

This paper describes the effects of adding gene reincarnation to a biologically inspired evolutionary algorithm. When using the biologically inspired part of the algorithm we are able to draw on experience from real life. Reincarnation capabilities, however, must be constructed without any real life experience to guide us. This paper addresses the question ‘can reincarnation be added to a genetic algorithm in such a way as to modify the resulting evolutionary process’? Reincarnation in this context requires that genetic information, saved from earlier generations, be bought back and reintroduced into the population at a later time. A simple algorithm is introduced that selects particular genetic material to add to the storage, performs regular culls of the stored material and inserts some of the stored material back into targeted individuals in later generations. Preliminary experiments show that while much of the reinserted material vanishes without having any obvious evolutionary effect, a small proportion remains for many generations and changes the course of the evolution compared to a genetic algorithm identical in all respects except that it lacks reincarnation.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Holland, J.H.: Adaption in Natural and Artificial Systems. University of Michigan Press (1975)

    Google Scholar 

  2. Davis, Lawrence (eds.): Handbook of Genetic Algorithms, 1st edn. Von Nostrand Reinhold, New York (1991)

    Google Scholar 

  3. Mauldin, M.L.: Maintaining diversity in genetic search. In: Proceedings of the National Conference on Artificial Intelligence, pp. 247–250 (1984)

    Google Scholar 

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

    MATH  Google Scholar 

  5. Tanese, R.: Distributed Genetic Algorithms. In: Proceedings of the Third International Conference on Genetic Algorithms, George Mason University (1989)

    Google Scholar 

  6. Levine, D.: A parallel genetic algorithm for the set partitioning problem. Technical report ANL-94/23, Argonne National Library (1994)

    Google Scholar 

  7. Copland, H., Hendtlass, T.: Migration Through Mutation Space: A Means of Accelerating Convergence. In: Proceedings of ICANNGA 1997, England (1997)

    Google Scholar 

  8. Hendtlass, T.: On the use of variable mutation in an evolutionary algorithm. In: Proceedings of IEA/AIE 1997, Gordon and Breach (1997)

    Google Scholar 

  9. Glover, F.: A Users Guide to Tabu Search. Annals of Operations Research vol. 41 J.C Baltzer AG (1993)

    Google Scholar 

  10. Podlena, J., Hendtlass, T.: An Accelerated Genetic Algorithm. Applied Intelligence 8(2) (1998)

    Google Scholar 

  11. Acan, A., Tekol, Y.: Chromosome Reuse in Genetic Algorithms. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 695–705. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  12. De Jong, K.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems. Doctoral Thesis, Univerity of Michigan (1975)

    Google Scholar 

  13. Prime, B., Hendtlass, T.: Evolutionary Computation Using Island Populations in Time. In: Orchard, B., Yang, C., Ali, M. (eds.) IEA/AIE 2004. LNCS (LNAI), vol. 3029, pp. 573–582. Springer, Heidelberg (2004)

    Google Scholar 

  14. Ackley, D.H.: A connectionist machine for genetic hill climbing. Kluwer Academic Publishers, Boston (1987)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Marcus Randall Hussein A. Abbass Janet Wiles

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prime, B., Hendtlass, T. (2007). Mechanisms for Evolutionary Reincarnation. In: Randall, M., Abbass, H.A., Wiles, J. (eds) Progress in Artificial Life. ACAL 2007. Lecture Notes in Computer Science(), vol 4828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76931-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76931-6_22

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-76931-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics