An Adaptive Reference Vector Adjustment Strategy and Improved Angle-Penalized Value Method for RVEA. (17th November 2021)

• Record Type: Journal Article
• Authors: Qiu, Wenbo; Zhu, Jianghan; Yu, Huangchao; Fan, Mingfeng; Huo, Lisu
• Other Names: Mariño Inés P. Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-11-17
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/8870356
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : Decomposition-based evolutionary multiobjective algorithms (MOEAs) divide a multiobjective problem into several subproblems by using a set of predefined uniformly distributed reference vectors and can achieve good overall performance especially in maintaining population diversity. However, they encounter huge difficulties in addressing problems with irregular Pareto fronts (PFs) since many reference vectors do not work during the searching process. To cope with this problem, this paper aims to improve an existing decomposition-based algorithm called reference vector-guided evolutionary algorithm (RVEA) by designing an adaptive reference vector adjustment strategy. By adding the strategy, the predefined reference vectors will be adjusted according to the distribution of promising solutions with good overall performance and the subspaces in which the PF lies may be further divided to contribute more to the searching process. Besides, the selection pressure with respect to convergence performance posed by RVEA is mainly from the length of normalized objective vectors and the metric is poor in evaluating the convergence performance of a solution with the increase of objective size. Motivated by that, an improved angle-penalized distance (APD) method is developed to better distinguish solutions with sound convergence performance in each subspace. To investigate the performance of the proposed algorithm, extensive experiments are conducted to compare it with 5 state-of-the-art decomposition-based algorithms on 3-, 5-, 8-, and 10-objective MaF1–MaF9. The results demonstrate that the proposed algorithm obtains the best overall performance.