Please use this identifier to cite or link to this item:
Title: Population-based incremental learning with memory scheme for changing environments
Authors: Yang, S
Keywords: Population-based incremental learning;Dynamic optimization problem;Memory scheme;Multi-population scheme
Issue Date: 2005
Publisher: ACM
Citation: Genetic and Evolutionary Computation Conference (GECCO'05), Washington DC, USA, 1: 711 - 718, 25-29 Jun 2005
Abstract: In recent years there has been a growing interest in studying evolutionary algorithms for dynamic optimization problems due to its importance in real world applications. Several approaches have been developed, such as the memory scheme. This paper investigates the application of the memory scheme for population-based incremental learning (PBIL) algorithms, a class of evolutionary algorithms, for dynamic optimization problems. A PBIL-specific memory scheme is proposed to improve its adaptability in dynamic environments. In this memory scheme the working probability vector is stored together with the best sample it creates in the memory and is used to reactivate old environments when change occurs. Experimental study based on a series of dynamic environments shows the efficiency of the memory scheme for PBILs in dynamic environments. In this paper, the relationship between the memory scheme and the multipopulation scheme for PBILs in dynamic environments is also investigated. The experimental results indicate a negative interaction of the multi-population scheme on the memory scheme for PBILs in the dynamic test environments.
Description: Copyright @ 2005 ACM
ISBN: 1-59593-010-8
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf177.67 kBAdobe PDFView/Open

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