This paper proposes a memory scheme based on abstraction for evolutionary algorithms to address dynamic optimization problems. In this memory scheme, the memory does not store good solutions as themselves but as their abstraction, i.e., their approximate location in the search space. When the environment changes, the stored abstraction information is extracted to generate new individuals into the population. Experiments are carried out to validate the abstraction based memory scheme. The results show the efficiency of the abstraction based memory scheme for evolutionary algorithms in dynamic environments. © 2008 Springer-Verlag Berlin Heidelberg.
Mendeley helps you to discover research relevant for your work.
CITATION STYLE
Richter, H., & Yang, S. (2008). Memory based on abstraction for dynamic fitness functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4974 LNCS, pp. 596–605). https://doi.org/10.1007/978-3-540-78761-7_65