Raising the dead: Extending evolutionary algorithms with a case-based memory

15Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

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. There- fore, 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.

Cite

CITATION STYLE

APA

Eggermont, J., Lenaerts, T., Poyhonen, S., & Termier, A. (2001). Raising the dead: Extending evolutionary algorithms with a case-based memory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2038, pp. 280–290). Springer Verlag. https://doi.org/10.1007/3-540-45355-5_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free