.png){kind=icon}
返回
An External Archive Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Combinatorial Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2014.2350995.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Domination-based sorting and decomposition are two basic strategies used in multiobjective evolutionary optimization. This paper proposes a hybrid multiobjective evolutionary algorithm integrating these two different strategies for combinatorial optimization problems with two or three objectives. The proposed algorithm works with an internal (working) population and an external archive. It uses a decomposition-based strategy for evolving its working population and uses a domination-based sorting for maintaining the external archive. Information extracted from the external archive is used to decide which search regions should be searched at each generation. In such a way, the domination-based sorting and the decomposition strategy can complement each other. In our experimental studies, the proposed algorithm is compared with a domination-based approach, a decomposition-based one, and one of its enhanced variants on two well-known multiobjective combinatorial optimization problems. Experimental results show that our proposed algorithm outperforms other approaches. The effects of the external archive in the proposed algorithm are also investigated and discussed.
Keyword:
Combinatorial multiobjective optimization
decomposition
Pareto optimality
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
.png){kind=icon}
PREAI
分享收藏分享收藏Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization在进化多目标优化中使用平均Hausdorff距离作为性能度量
PREAI
分享收藏分享收藏
分享收藏
查看更多内容