.png){kind=icon}
Return
A new prediction-based evolutionary dynamic multiobjective optimization algorithm aided by Pareto optimal solution estimation strategy
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2024.112022.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic multiobjective optimization problems (DMOPs) typically involve multiple conflicting time-varying objectives that require optimization algorithms to quickly track the changing Pareto-optimal front (POF). To this end, several methods have been developed to predict new locations of moving Pareto-optimal solution set (POS) so that populations can be re-initialized around the predicted locations. In this paper, a dynamic multi- objective optimization algorithm based on a multi-directional difference model (MOEA/D-MDDM) is proposed. The multi-directional difference model predicts the initial population through the estimated populations developed by a designed POS estimation strategy. An adaptive crossover-rate approach is incorporated into the optimization process to cope with different POS structures. To investigate the performance of the proposed approach, MOEA/D-MDDM has been compared with six state-of-the-art dynamic multiobjective optimization evolutionary algorithms (DMOEAs) on 19 benchmark problems. The experimental results demonstrate that the proposed algorithm can effectively deal with DMOPs whose POS has a single-modality characteristic and continuous manifolds.
Keywords:
Dynamic multiobjective optimization problem
Evolutionary algorithm
POS estimation strategy
Multi-directional difference prediction
Adaptive crossover rate
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
View more