Chaotic Genetic Algorithm based on Explicit Memory with a new Strategy for Updating and Retrieval of Memory in Dynamic Environments

Many problems considered in the optimization and learning processes assume that solutions change dynamically. Hence, the algorithms are required that dynamically adapt with the new conditions of the problem through searching new conditions. Mostly, utilization of information from the past allows to quickly adapting changes right after they occur in the environment. This is the idea underlining the use of memory in this field, what involves the key design issues concerning the memory content, update process, and retrieval process. In this work, we use the chaotic genetic algorithm (GA) with memory for solving dynamic optimization problems. A chaotic system has a much more accurate prediction of the future compared with a random system. The proposed method uses a new memory with diversity maximization. Here, we propose a new strategy for updating memory and memory retrieval. An experimental study is conducted based on the moving peaks benchmark (MPB) in order to test the performance of the developed method in comparison with several state-of-the-art algorithms from the literature. The experimental results obtained show the superiority and more effectiveness of the proposed algorithm in dynamic environments.