Memory based on abstraction for dynamic fitness functions

  • Authors:
  • Hendrik Richter;Shengxiang Yang

  • Affiliations:
  • HTWK Leipzig, Fachbereich Elektrotechnik und Informationstechnik, Institut Mess-, Steuerungs- und Regelungstechnik, Leipzig, Germany;Department of Computer Science, University of Leicester, Leicester, United Kingdom

  • Venue:
  • Evo'08 Proceedings of the 2008 conference on Applications of evolutionary computing
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.