多目标优化
帕累托原理
进化算法
分解
数学优化
人工神经网络
计算机科学
数学
人工智能
算法
生态学
生物
作者
Yiping Liu,Hisao Ishibuchi,Naoki Masuyama,Yusuke Nojima
标识
DOI:10.1109/tevc.2019.2926151
摘要
The performance of decomposition-based multiobjective evolutionary algorithms (MOEAs) often deteriorates clearly when solving multiobjective optimization problems with irregular Pareto fronts (PFs). The main reason is the improper settings of reference vectors and scalarizing functions. In this paper, we propose a decomposition-based MOEA guided by a growing neural gas network, which learns the topological structure of the PF. Both reference vectors and scalarizing functions are adapted based on the topological structure to enhance the evolutionary algorithm's search ability. The proposed algorithm is compared with eight state-of-the-art optimizers on 34 test problems. The experimental results demonstrate that the proposed method is competitive in handling irregular PFs.
科研通智能强力驱动
Strongly Powered by AbleSci AI