A reference vector adaptive strategy for balancing diversity and convergence in many-objective evolutionary algorithms

被引:5
作者
Zhang, Lin [1 ]
Wang, Liping [1 ]
Pan, Xiaotian [1 ]
Qiu, Qicang [2 ]
机构
[1] Zhejiang Univ Technol, Coll Comp Sci & Technol, Coll Software, Hangzhou 310023, Peoples R China
[2] Zhejiang Lab, Hangzhou 310023, Peoples R China
基金
中国国家自然科学基金;
关键词
Many-objective optimization problems; Decomposition; Complex Pareto fronts; Reference vector adaptation; MULTIOBJECTIVE OPTIMIZATION; MOEA/D;
D O I
10.1007/s10489-022-03545-w
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Decomposition-based multiobjective evolutionary algorithms (MOEA/D) have achieved great success in the field of evolutionary multiobjective optimization, and their outstanding performance in solving for the Pareto-optimal solution set has attracted attention. This type of algorithm uses reference vectors to decompose the multiobjective problem into multiple single-objective problems and searches them collaboratively, hence the choice of reference vectors is particularly important. However, predefined reference vectors may not be suitable for dealing with many-objective optimization problems with complex Pareto fronts (PFs), which can affect the performance of MOEA/D. To solve this problem, we introduce a reference vector initialization strategy, namely, scaling of the reference vectors (SRV), and also propose a new reference vector adaptation strategy, that is, transformation of the solution positions (TSP) based on the ideal point solution, to deal with irregular PFs. The TSP strategy can adaptively redistribute the reference vectors through periodic adjustment to endow that the solution set with better convergence and a better distribution. Both strategies are introduced into a representative MOEA/D, called.-DEA-TSP, which is compared with five state-of-the-art algorithms to verify the effectiveness of the proposed TSP strategy.
引用
收藏
页码:7423 / 7438
页数:16
相关论文
共 40 条
[1]  
Aggarwal CC, 2001, LECT NOTES COMPUT SC, V1973, P420
[2]   Surrogate-assisted multi-objective particle swarm optimization for the operation of CO2 capture using VPSA [J].
Alkebsi, Khalil ;
Du, Wenli .
ENERGY, 2021, 224
[3]   Towards decomposition based multi-objective workflow scheduling for big data processing in clouds [J].
Bugingo, Emmanuel ;
Zhang, Defu ;
Chen, Zhaobin ;
Zheng, Wei .
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (01) :115-139
[4]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791
[5]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[6]  
Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032
[7]  
Deb K, 2004, ADV INFO KNOW PROC, P105
[8]  
Deb K., 2005, On finding Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems
[9]   MOEA/D with a self-adaptive weight vector adjustment strategy based on chain segmentation [J].
Dong, Zhiming ;
Wang, Xianpeng ;
Tang, Lixin .
INFORMATION SCIENCES, 2020, 521 :209-230
[10]   Self-Organizing Map-Based Weight Design for Decomposition-Based Many-Objective Evolutionary Algorithm [J].
Gu, Fangqing ;
Cheung, Yiu-Ming .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2018, 22 (02) :211-225