进化算法
多目标优化
数学优化
计算机科学
帕累托原理
集合(抽象数据类型)
进化计算
点(几何)
适应(眼睛)
算法
多样性(控制论)
帕累托最优
遗传算法
数学
人工智能
物理
光学
程序设计语言
几何学
作者
Ye Tian,Ran Cheng,Xingyi Zhang,Fan Cheng,Yaochu Jin
标识
DOI:10.1109/tevc.2017.2749619
摘要
During the past two decades, a variety of multiobjective evolutionary algorithms (MOEAs) have been proposed in the literature. As pointed out in some recent studies, however, the performance of an MOEA can strongly depend on the Pareto front shape of the problem to be solved, whereas most existing MOEAs show poor versatility on problems with different shapes of Pareto fronts. To address this issue, we propose an MOEA based on an enhanced inverted generational distance indicator, in which an adaptation method is suggested to adjust a set of reference points based on the indicator contributions of candidate solutions in an external archive. Our experimental results demonstrate that the proposed algorithm is versatile for solving problems with various types of Pareto fronts, outperforming several state-of-the-art evolutionary algorithms for multiobjective and many-objective optimization.
科研通智能强力驱动
Strongly Powered by AbleSci AI