A dynamic multiobjective evolutionary algorithm based on a dynamic evolutionary environment model
Traditional dynamic multiobjective evolutionary algorithms usually imitate the evolution of nature, maintaining diversity of population through different strategies and making the population track the Pareto optimal solution set efficiently after the environmental change. However, these algorithms neglect the role of the dynamic environment in evolution, leading to the lacking of active guieded search. In this paper, a dynamic multiobjective evolutionary algorithm based on a dynamic evolutionary environment model is proposed (DEE-DMOEA). When the environment has not changed, this algorithm makes use of the evolutionary environment to record the knowledge and information generated in evolution, and in turn, the knowledge and information guide the search. When a change is detected, the algorithm helps the population adapt to the new environment through building a dynamic evolutionary environment model, which enhances the diversity of the population by the guided method, and makes the environment and population evolve simultaneously. In addition, an implementation of the algorithm about the dynamic evolutionary environment model is introduced in this paper. The environment area and the unit area are employed to express the evolutionary environment. Furthermore, the strategies of constraint, facilitation and guidance for the evolution are proposed. Compared with three other state-of-the-art strategies on a series of test problems with linear or nonlinear correlation between design variables, the algorithm has shown its effectiveness for dealing with the dynamic multiobjective problems.
The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.
Citation : Zou, J., Li, Q., Yang, S., Zheng, J., Peng, Z. and Pei, T. (2018) A dynamic multiobjective evolutionary algorithm based on a dynamic evolutionary environment model. Swarm and Evolutionary Computation, 44, pp. 247-259
ISSN : 2210-6502
Research Group : Centre for Computational Intelligence
Research Institute : Institute of Artificial Intelligence (IAI)
Peer Reviewed : Yes
Showing items related by title, author, creator and subject.
The use of evolutionary programming algorithms with self-adaptation of the mutation distribution for dynamic optimization problems is investigated in this paper. In the proposed method, the q-Gaussian distribution is ...
Jiang, Shouyong (Thesis or dissertation / Doctoral / PhD)Many real-world optimization problems consist of a number of conflicting objectives that have to be optimized simultaneously. Due to the presence of multiple conflicting ob- jectives, there is no single solution that can ...
Khan, Muhammad Asif (Thesis or dissertation / Doctoral / PhD)Over the past few years information technology (IT) and business alignment has become a great concern to organizations. To achieve alignment has become a daunting task for organizations due to rapid changes in business ...