Dynamic multi-objective optimization algorithm based on individual prediction

被引:0
作者
Wang W.-L. [1 ]
Chen Z.-K. [1 ]
Wu F. [1 ]
Wang Z. [1 ]
Yu M.-J. [1 ]
机构
[1] College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou
来源
Zhejiang Daxue Xuebao (Gongxue Ban)/Journal of Zhejiang University (Engineering Science) | 2023年 / 57卷 / 11期
关键词
correction by feedback; diversity; dynamic multi-objective optimization; reference point relation algorithm; special point;
D O I
10.3785/j.issn.1008-973X.2023.11.001
中图分类号
学科分类号
摘要
A dynamic multi-objective optimization algorithm based on individual prediction (IPS) was proposed to quickly track the Pareto optimal front of the dynamic multi-objective optimization problem that changed with the environment. Firstly, the special points with good convergence and diversity were selected by the reference point relation algorithm, and the environment changes can be quickly responded to by predicting the special points set. Secondly, a feedback correction mechanism for population center point predication was proposed, and in the process of predicting the non-dominant solution set, the prediction step size was corrected to make the prediction more accurate. Finally, to avoid the algorithm falling into local optimal, a hybrid diversity maintenance mechanism was proposed, which introduced random individuals generated by Latin hypercube sampling and a precision controllable mutation strategy to improve the diversity of the population. The proposed algorithm was compared with the other four dynamic multi-objective optimization algorithms. Experimental results show that IPS can balance the diversity and convergence of the population, and the experimental results are better than that of the other four algorithms on the FDA, DMOP, and F5~F10 test suite. © 2023 Zhejiang University. All rights reserved.
引用
收藏
页码:2133 / 2146
页数:13
相关论文
共 37 条
[1]  
ZOU J, ZHENG J, DENG C, Et al., An evaluation of non-redundant objective sets based on the spatial similarity ratio [J], Soft Computing, 19, 8, pp. 2275-2286, (2015)
[2]  
WANG Wan-liang, JIN Ya-wen, CHEN Jia-cheng, Et al., Multiobjective particle swarm optimization algorithm with multi-role and multi-strategy [J], Journal of Zhejiang University: Engineering Science, 56, 3, pp. 531-541, (2022)
[3]  
ZHANG Cheng, JIN Tao, LI Pei-qiang, Et al., Wide-area coordination control strategy for power system using multiobjective bat algorithm [J], Journal of Zhejiang University: Engineering Science, 53, 3, pp. 589-597, (2019)
[4]  
CHEN Jun-jie, LI Hong-jun, CAO Zhang-hua, Performance-aware resource allocation algorithm for core network control plane [J], Journal of Zhejiang University: Engineering Science, 55, 9, pp. 1782-1787, (2021)
[5]  
DEB K, PRATAP A, AGARWAL S, Et al., A fast and elitist multiobjective genetic algorithm: NSGA-II [J], IEEE Transactions on Evolutionary Computation, 6, 2, pp. 182-197, (2002)
[6]  
ZHANG Q, ZHOU A, JIN Y., RM-MEDA: a regularity model-based multiobjective estimation of distribution algorithm [J], IEEE Transactions on Evolutionary Computation, 12, 1, pp. 41-63, (2008)
[7]  
ZHANG Q, LI H., MOEA/D: a multiobjective evolutionary algorithm based on decomposition [J], IEEE Transactions on Evolutionary Computation, 11, 6, pp. 712-731, (2007)
[8]  
GIUSEPPE P, STEFANO S., To Celigny, in the footprints of vilfredo pareto's "optimum" [Historical Corner] [J], IEEE Antennas and Propagation Magazine, 56, 3, pp. 249-254, (2014)
[9]  
HATZAKIS I, WALLACE D., Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach [C], Genetic and Evolutionary Computation Conference, pp. 1201-1208, (2006)
[10]  
ZHOU A, JIN Y, ZHANG Q., A population prediction strategy for evolutionary dynamic multiobjective optimization [J], IEEE Transactions on Cybernetics, 44, 1, pp. 40-53, (2014)