.png){kind=icon}
.png){kind=icon}
Return
A Co-evolutionary Multi-population Evolutionary Algorithm for Dynamic Multiobjective Optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2024.101648.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic multiobjective optimization problems (DMOPs) widely appear in various real-world applications and have attracted increasing attention worldwide. However, how to obtain both good population diversity and fast convergence speed to efficiently solve DMOPs are two challenging issues. Inspired by that the multiple populations for multiple objectives (MPMO) framework can provide algorithms with good population diversity and fast convergence speed, this paper proposes a new efficient algorithm called a co-evolutionary multi-population evolutionary algorithm (CMEA) based on the MPMO framework together with three novel strategies, which are helpful for solving DMOPs efficiently from two aspects. First, in the evolution control aspect, a convergencebased population evolution strategy is proposed to select the suitable population for executing the evolution in different generations, so as to accelerate the convergence speed of the algorithm. Second, in the dynamic control aspect, a multi-population-based dynamic detection strategy and a multi-population-based dynamic response strategy are proposed to help the algorithm maintain the population diversity, which are efficient for detecting and responding to the dynamic changes of environments. Integrating with the above strategies, the CMEA is proposed to solve the DMOP efficiently. The superiority of the proposed CMEA is validated in experiments on widely-used DMOP benchmark problems.
Keywords:
Dynamic multiobjective optimization problem
(DMOP)
Multiple populations for multiple objectives
(MPMO)
Evolutionary computation (EC)
Co-evolutionary multi-population evolutionary
algorithm (CMEA)
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W
View more organizations