Handling Dynamic Multiobjective Optimization Environments via Layered Prediction and Subspace-Based Diversity Maintenance

被引:40
作者
Hu, Yaru [1 ]
Zheng, Jinhua [1 ]
Jiang, Shouyong [2 ]
Yang, Shengxiang [3 ]
Zou, Juan [1 ]
机构
[1] Xiangtan Univ, Key Lab Intelligent Comp & Informat Proc, Minist Educ, Xiangtan 411105, Peoples R China
[2] Univ Aberdeen, Dept Comp Sci, Aberdeen AB24 3FX, Scotland
[3] De Montfort Univ, Ctr Computat Intelligence, Sch Comp Sci & Informat, Leicester LE1 9BH, England
基金
中国国家自然科学基金;
关键词
Statistics; Sociology; Optimization; Convergence; Heuristic algorithms; Maintenance engineering; Linear programming; Change response; dynamic multiobjective optimization (DMO); gap filling; layered prediction (LP); subspace-based diversity maintenance (SDM); ALGORITHM; STRATEGY;
D O I
10.1109/TCYB.2021.3128584
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this article, we propose an evolutionary algorithm based on layered prediction (LP) and subspace-based diversity maintenance (SDM) for handling dynamic multiobjective optimization (DMO) environments. The LP strategy takes into account different levels of progress by different individuals in evolution and historical information to predict the population in the event of environmental changes for a prompt change response. The SDM strategy identifies gaps in population distribution and employs a gap-filling technique to increase population diversity. SDM further guides rational population reproduction with a subspace-based probability model to maintain the balance between population diversity and convergence in every generation of evolution regardless of environmental changes. The proposed algorithm has been extensively studied through comparison with five state-of-the-art algorithms on a variety of test problems, demonstrating its effectiveness in dealing with DMO problems.
引用
收藏
页码:2572 / 2585
页数:14
相关论文
共 52 条
[1]   A dynamic multi-objective evolutionary algorithm using a change severity-based adaptive population management strategy [J].
Azzouz, Radhia ;
Bechikh, Slim ;
Ben Said, Lamjed .
SOFT COMPUTING, 2017, 21 (04) :885-906
[2]  
Biswas S, 2014, 2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), P3192, DOI 10.1109/CEC.2014.6900487
[3]  
Branke J., 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), P1875, DOI 10.1109/CEC.1999.785502
[4]   Evolutionary Dynamic Multiobjective Optimization Assisted by a Support Vector Regression Predictor [J].
Cao, Leilei ;
Xu, Lihong ;
Goodman, Erik D. ;
Bao, Chunteng ;
Zhu, Shuwei .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (02) :305-319
[5]   Decomposition-based evolutionary dynamic multiobjective optimization using a difference model [J].
Cao, Leilei ;
Xu, Lihong ;
Goodman, Erik D. ;
Li, Hui .
APPLIED SOFT COMPUTING, 2019, 76 :473-490
[6]   A Novel Evolutionary Algorithm for Dynamic Constrained Multiobjective Optimization Problems [J].
Chen, Qingda ;
Ding, Jinliang ;
Yang, Shengxiang ;
Chai, Tianyou .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (04) :792-806
[7]   Dynamic Multiobjectives Optimization With a Changing Number of Objectives [J].
Chen, Renzhi ;
Li, Ke ;
Yao, Xin .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (01) :157-171
[8]  
Deb, 1999, COMPUT SCI INFORM, V26, P30
[9]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[10]   Dynamic multiobjective optimization problems: Test cases, approximations, and applications [J].
Farina, M ;
Deb, K ;
Amato, P .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (05) :425-442