.png){kind=icon}
返回
An evolutionary algorithm based on rank-1 approximation for sparse large-scale multi-objective problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-023-08825-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Most existing evolutionary algorithms encounter difficulties in dealing with multi-objective problems (MOPs) whose Pareto optimal solutions are sparse, especially when the decision space of the MOP is large. Most existing sparse evolutionary algorithms (EAs) lack the tricks specially for large-scale problems, and the existing tricks need some grouping/variable analysis methods to divide the large-scale variables, which severely affects the effect of optimization. To fill this gap, an evolutionary algorithm based on rank-1 approximation, suitable to reduce the dimensionality of sparse higher-order datasets, is proposed. First, canonical polyadic decomposition is introduced to divide the higher-dimensional set of decision variables into several lower-dimensional sub-sets. These sub-populations are alternatively optimized by a sparse evolution algorithm with special genetic strategies, to search for improved solutions in their respective lower-dimensional decision sub-space. Finally, the whole population is asymptotically optimized by all the sub-populations. The proposed algorithm first introduces the rank-1 approximation into the dimensionality reduction in sparse large-scale variables, combines it with the sparse EA, and proposes efficient alternative optimization strategy to solve the non-convex problem resulted from the multiple sub-problems. It is compared with other state-of-the-art algorithms for large-scale and sparse problems. The experimental results indicate that it outperforms other algorithms in terms of optimization performance and convergence rate.
Keyword:
Evolutionary algorithm
Large-scale multi-objective optimization
Rank-1 approximation
CP decomposition
Sparse Pareto optimal solutions
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台
OAAI
.png){kind=icon}
OAAI分享收藏A Tensor-Based Optimization Model for Secure Sustainable Cyber-Physical-Social Big Data Computations基于张量的安全可持续网络-物理-社会大数据计算优化模型
PREAI
分享收藏A random dynamic grouping based weight optimization framework for large-scale multi-objective optimization problems基于随机动态分组的大规模多目标优化问题权重优化框架
PREAI
分享收藏分享收藏Solving Large-Scale Multiobjective Optimization Problems With Sparse Optimal Solutions via Unsupervised Neural Networks基于无监督神经网络求解具有稀疏最优解的大规模多目标优化问题OAAI
OAAI分享收藏
查看更多内容