.png){kind=icon}
.png){kind=icon}
Return
A dynamic multi-objective evolutionary algorithm using adaptive reference vector and linear prediction
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2023.101281.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Responding to environmental changes quickly is a very key component in solving dynamic multi-objective optimization problems (DMOPs). Most existing methods perform well on predicting individuals, but exist some difficulties in improving the accuracy of the predicted population. This paper proposes an approach that predicting the population based on the adjusted reference vector (RVCP) combined with a multi-objective evolutionary algorithm to solve DMOPs. First, the nondominated set is predicted by a linear prediction strategy, which can relocate elite solutions to track the true Pareto set (POS) in the new environment. Second, an adaptive reference-vector-based adjustment strategy is introduced based on the number of nondominated solutions. Then the population in the new environmention is predicted in terms of the adjusted reference vectors, which can track the POS and/or the true Pareto front (POF) more accurately. Finally, a noise-based individual expansion strategy is applied, which can generate variation individuals to keep the population in good diversity. To prove the effectiveness of RVCP, it is compared with five popular dynamic multi-objective evolutionary algorithms (DMOEAs) on twelve test instances with different dynamic characteristics. The experimental results show that RVCP has certain advantages in dealing with DMOPs.
Keywords:
Dynamic multi-objective optimization
Evolutionary algorithms
Prediction
Reference vector
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W