.png){kind=icon}
返回
Improved SparseEA for sparse large-scale multi-objective optimization problems
.png){kind=icon}
OA
AI
DOI：10.1007/s40747-021-00553-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Sparse large-scale multi-objective optimization problems (LSMOPs) widely exist in real-world applications, which have the properties of involving a large number of decision variables and sparse Pareto optimal solutions, i.e., most decision variables of these solutions are zero. In recent years, sparse LSMOPs have attracted increasing attentions in the evolutionary computation community. However, all the recently tailored algorithms for sparse LSMOPs put the sparsity detection and maintenance in the first place, where the nonzero variables can hardly be optimized sufficiently within a limited budget of function evaluations. To address this issue, this paper proposes to enhance the connection between real variables and binary variables within the two-layer encoding scheme with the assistance of variable grouping techniques. In this way, more efforts can be devoted to the real part of nonzero variables, achieving the balance between sparsity maintenance and variable optimization. According to the experimental results on eight benchmark problems and three real-world applications, the proposed algorithm is superior over existing state-of-the-art evolutionary algorithms for sparse LSMOPs.
Keyword:
Large-scale multi-objective optimization
Sparse pareto optimal solutions
Evolutionary algorithm
Real-world applications
期刊
IF:
4.6
论文数:
2.1K
被引数:
6.6K
机构
引用论文
.png){kind=icon}
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台
OAAI
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏分享收藏DG2: A Faster and More Accurate Differential Grouping for Large-Scale Black-Box OptimizationDG2: 用于大规模黑盒优化的更快，更准确的差分分组OAAI
OAAI分享收藏
查看更多内容