Please use this identifier to cite or link to this item:
Title: Learning in abstract memory schemes for dynamic optimization
Authors: Richter, H
Yang, S
Keywords: Abstraction based memory scheme;Evolutionary algorithms;Dynamic environments;Dynamic optimization problems (DOPs)
Issue Date: 2008
Citation: Fourth International Conference on Natural Computation, Jinan, China, 25-27 August 2008, pp 86-91
Abstract: We investigate an abstraction based memory scheme for evolutionary algorithms in dynamic environments. In this scheme, the abstraction of good solutions (i.e., their approximate location in the search space) is stored in the memory instead of good solutions themselves and is employed to improve future problem solving. In particular, this paper shows how learning takes place in the abstract memory scheme and how the performance in problem solving changes over time for different kinds of dynamics in the fitness landscape. The experiments show that the abstract memory enables learning processes and efficiently improves the performance of evolutionary algorithms in dynamic environments.
Appears in Collections:Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf198.51 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.