When using Evolutionary Algorithms (EAs) in dynamic environments some extensions have been introduced in order to avoid the premature convergence of the population towards a non-optimal point of the search space. One of these improvements consists in adding an explicit memory used for storing good individuals from the search population. When the environment is cyclic and previous environments reappear later memory should maintain EA's performance by keeping individuals' fitness at an acceptable level. But in most situations this purpose is not achieved and the typical behavior of an EA when a change occurs involves the decrease of the best individual's fitness and some time is necessary to readapt to the new conditions. The key problem when using explicit memory is the restriction usually imposed on its size. So, when it is necessary to store a new individual and memory is full we need to replace some individuals. This replacement can lead to the destruction of information that might be useful in the future. In this paper we are interested in the enhancement of memory's usage and we propose two new replacing methods to apply when memory is full. The investigated methods were tested in several memory-based EAs and the results show that memory can be used in a more effective way so algorithms' performance is strongly improved.
IEEE 2007 Congress on Evolutionary Computation, September 2007
Cited by
Year 2014 : 2 citations
Zhu, T., Luo, W., & Yue, L. (2014, July). Combining multipopulation evolutionary algorithms with memory for dynamic optimization problems. In Evolutionary Computation (CEC), 2014 IEEE Congress on (pp. 2047-2054). IEEE.
Morales-Enciso, S., & Branke, J. (2014). Response surfaces with discounted information for global optima tracking in dynamic environments. In Nature Inspired Cooperative Strategies for Optimization (NICSO 2013) (pp. 57-69). Springer International Publishing.
Year 2012 : 2 citations
T. T. Nguyen, S. Yang, and J. Branke (2012). “Evolutionary dynamic optimization: A survey of the state of the art”. Swarm and Evolutionary Computation, Elsevier, 2012.
Shengxiang Yang, Yong Jiang, and Trung Thanh Nguyen (2012). "Metaheuristics for dynamic combinatorial optimization problems." IMA Journal of Management Mathematics, 2012.
Year 2009 : 2 citations
J. Tim Hendtlass, Irene Moser, Marcus Randal (2009). Dynamic Problems and Nature Inspired Meta-heuristics. Biologically-Inspired Optimisation Methods , Series Studies in Computational Intelligence, Volume 210, pp. 79-109, Springer 2009.
Xin Yu, Ke Tang, Tianshi Chen, Xin Yao (2009). Empirical analysis of evolutionary algorithms with immigrants schemes for dynamic optimization. Journal of Memetic Computing, Vol. 1, 1, pp. 3-24, Springer 2009.
