Dynamic multi-objective evolutionary algorithm based on decomposition with hybrid prediction

Abstract

Abstract The proposed dynamic multi-objective evolutionary algorithm, DMOEA/D-HP, addresses temporal variations in both the Pareto Front (PF) and Pareto Set (PS) for dynamic multi-objective optimization problems (DMOPs). Utilizing a hybrid prediction approach, the algorithm adapts to the dynamic nature of the problem. The population is divided into three segments for prediction: individuals with a distance greater than a threshold in PS for central prediction, those with a distance less than a threshold in PS for differential evolutionary prediction, and the remaining individuals for cross-mutation to maintain diversity. To assess DMOEA/D-HP’s effectiveness, it is compared with three advanced algorithms in DMOP by using the DF test set. Experimental results demonstrate that DMOEA/D-HP outperforms in terms of distribution and convergence when solving DMOPs.