期刊
INFORMATION SCIENCES
卷 563, 期 -, 页码 375-400出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2021.03.008
关键词
Achievement scalarizing function; Angle-based selection; Decomposition; Evolutionary algorithm; Many-objective optimization; Reference vector; Pareto front curvature; Similarity
资金
- National Natural Science Foundation of China [62006058, U1811264, U1711263, 61966009, 61862016]
- Guangxi Natural Science Foundation [2018GXNSFAA138090, 2018GXNSFDA281049, 2018GXNSFDA281045, 2019GXNSFBA245049]
This paper proposes an online Pareto front curvature estimator and adaptive scalarizing functions to improve the performance of solving multi-objective optimization problems, while ensuring sensitivity to the Pareto front curvature and similarity evaluation in high dimensions. The diversity of Pareto optimal solutions is ensured by introducing a novel similarity metric.
Evolutionary algorithms have been proven to be effective in solving multi-objective optimization problems. However, their performance deteriorates progressively in handling many-objective optimization problems due to the sensitivity upon the curvature of Pareto front, as well as the implicit evaluation on similarity in high dimensionality. This paper proposes an on-line Pareto front curvature estimator for an adaptive selection, in which the achievement scalarizing function is used to identify the pivotal solution to extrapolate the geometric information. Then an adaptive scalarizing function based fitness assessment, which guarantees the Pareto optimality, is presented. The diversity of the Pareto optimal solutions is also ensured by introducing a novel similarity metric. Finally, an extensive experimental analysis is presented to corroborate the analytical result by evaluating problems with various types of Pareto fronts. The experimental results substantiate the efficacy of the results with competitive performance. (c) 2021 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据