渡线
进化算法
数学优化
水准点(测量)
帕累托原理
维数之咒
计算机科学
最优化问题
算法
多目标优化
操作员(生物学)
比例(比率)
数学
人工智能
生物化学
化学
抑制因子
大地测量学
基因
转录因子
物理
地理
量子力学
作者
Ye Tian,Chang Hou Lu,Xingyi Zhang,Fan Cheng,Yaochu Jin
标识
DOI:10.1109/tcyb.2020.3041325
摘要
In real-world applications, there exist a lot of multiobjective optimization problems whose Pareto-optimal solutions are sparse, that is, most variables of these solutions are 0. Generally, many sparse multiobjective optimization problems (SMOPs) contain a large number of variables, which pose grand challenges for evolutionary algorithms to find the optimal solutions efficiently. To address the curse of dimensionality, this article proposes an evolutionary algorithm for solving large-scale SMOPs, which aims to mine the sparse distribution of the Pareto-optimal solutions and, thus, considerably reduces the search space. More specifically, the proposed algorithm suggests an evolutionary pattern mining approach to detect the maximum and minimum candidate sets of the nonzero variables in the Pareto-optimal solutions, and uses them to limit the dimensions in generating offspring solutions. For further performance enhancement, a binary crossover operator and a binary mutation operator are designed to ensure the sparsity of solutions. According to the results on eight benchmark problems and four real-world problems, the proposed algorithm is superior over existing evolutionary algorithms in solving large-scale SMOPs.
科研通智能强力驱动
Strongly Powered by AbleSci AI