Abstract
In dynamically changing environments, the performance of a standard evolutionary algorithm deteriorates. This is due to the fact that the population, which is considered to contain the history of the evolutionary process, does not contain enough information to allow the algorithm to react adequately to changes in the fitness landscape. Therefore, we added a simple, global case-based memory to the process to keep track of interesting historical events. Through the introduction of this memory and a storing and replacement scheme we were able to improve the reaction capabilities of an evolutionary algorithm with a periodically changing fitness function.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
W. Banzhaf, P. Nordin, R.E. Keller, and F.D. Francone. Genetic Programing: an introduction. Morgan Kauffman, 1998.
J. Branke. Evolutionary approaches to dynamic optimization problems; a survey. GECCO Workshop on Evolutionary Algorithms for Dynamic Optimization Problems, pages 134–137, 1999.
D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, 1989.
D.E. Goldberg and R.E. Smith. Nonstationary function optimization using genetic algorithms with dominance and diploidy. 2nd International Conference on Genetic Algorithms, pages 59–68, 1987.
W. Hillis. Co-evolving parasites improve simulated evolution as an opimization procedure. Artificial Life II, pages 313–324, 1992.
M. Keijzer, J.J. Merlo, and M. Schoenauer, editors. Evolutionary Objects. http://www.sourceforge.net/projects/eodev/.
J.J. Merelo, editor. EO Evolutionary Computation Framework. http://www.geneura.ugr.es/~jmerelo/EO.html/.
M. Mitchell. An Introduction to Genetic Algorithms. A Bradford Book, MIT Press, 3th edition, 1997.
J. Paredis. Coevolutionary algorithms. The Handbook of Evolutionary Computation, 1997.
J. Paredis. Coevolution, memory and balance. International Joint Conference on Artificial Intelligence, pages 1212–1217, 1999.
W.A. Rosenkrantz. Introduction to Probability and Statistics for Scientists and Engineers. Mc. Graw-Hill, series in Probability and Statistics, 1997.
C. Rosin. Coevolutionary Search among Adversaries. PhD thesis, University of California, San Diego, 1997.
C. Ryan. Diploidy without dominance. 3rd Nordic Workshop on Genetic Algorithms, pages 63–70, 1997.
A. Silberschatz and P. Galvin. Operating System Concepts. Wiley, 5edition, 1998.
L. Spector, W.B. Langdon, U.-M. O’Reilly, and P.J. Angeline, editors. Advances in Genetic Programming, volume 3. MIT Press, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eggermont, J., Lenaerts, T., Poyhonen, S., Termier, A. (2001). Raising the Dead: Extending Evolutionary Algorithms with a Case-Based Memory. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tettamanzi, A.G.B., Langdon, W.B. (eds) Genetic Programming. EuroGP 2001. Lecture Notes in Computer Science, vol 2038. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45355-5_22
Download citation
DOI: https://doi.org/10.1007/3-540-45355-5_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41899-3
Online ISBN: 978-3-540-45355-0
eBook Packages: Springer Book Archive