Population-Based Incremental Learning With Associative Memory for Dynamic Environments. Yang, S. & Yao, X. Evolutionary Computation, IEEE Transactions on, 12(5):542--561, 2008.
Population-Based Incremental Learning With Associative Memory for Dynamic Environments [link]Paper  doi  abstract   bibtex   
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several approaches, such as the memory and multiple population schemes, have been developed for EAs to address dynamic problems. This paper investigates the application of the memory scheme for population-based incremental learning (PBIL) algorithms, a class of EAs, for DOPs. A PBIL-specific associative memory scheme, which stores best solutions as well as corresponding environmental information in the memory, is investigated to improve its adaptability in dynamic environments. In this paper, the interactions between the memory scheme and random immigrants, multipopulation, and restart schemes for PBILs in dynamic environments are investigated. In order to better test the performance of memory schemes for PBILs and other EAs in dynamic environments, this paper also proposes a dynamic environment generator that can systematically generate dynamic environments of different difficulty with respect to memory schemes. Using this generator, a series of dynamic environments are generated and experiments are carried out to compare the performance of investigated algorithms. The experimental results show that the proposed memory scheme is efficient for PBILs in dynamic environments and also indicate that different interactions exist between the memory scheme and random immigrants, multipopulation schemes for PBILs in different dynamic environments.
@article{yang_population-based_2008,
	title = {Population-{Based} {Incremental} {Learning} {With} {Associative} {Memory} for {Dynamic} {Environments}},
	volume = {12},
	issn = {1089-778X},
	url = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4454713},
	doi = {10.1109/TEVC.2007.913070},
	abstract = {In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several approaches, such as the memory and multiple population schemes, have been developed for EAs to address dynamic problems. This paper investigates the application of the memory scheme for population-based incremental learning (PBIL) algorithms, a class of EAs, for DOPs. A PBIL-specific associative memory scheme, which stores best solutions as well as corresponding environmental information in the memory, is investigated to improve its adaptability in dynamic environments. In this paper, the interactions between the memory scheme and random immigrants, multipopulation, and restart schemes for PBILs in dynamic environments are investigated. In order to better test the performance of memory schemes for PBILs and other EAs in dynamic environments, this paper also proposes a dynamic environment generator that can systematically generate dynamic environments of different difficulty with respect to memory schemes. Using this generator, a series of dynamic environments are generated and experiments are carried out to compare the performance of investigated algorithms. The experimental results show that the proposed memory scheme is efficient for PBILs in dynamic environments and also indicate that different interactions exist between the memory scheme and random immigrants, multipopulation schemes for PBILs in different dynamic environments.},
	number = {5},
	journal = {Evolutionary Computation, IEEE Transactions on},
	author = {Yang, Shengxiang and Yao, Xin},
	year = {2008},
	keywords = {Dynamic environments, Evolutionary algorithms, content-addressable storage, dynamic optimization problems, evolutionary computation, learning (artificial intelligence)associative memory, multiple population schemes, population-based incremental learning, random immigrants},
	pages = {542--561}
}

Downloads: 0