.png){kind=icon}
返回
Evolutionary Many-Objective Algorithms for Combinatorial Optimization Problems: A Comparative Study
.png){kind=icon}
OA
AI
DOI：10.1007/s11831-020-09415-3.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Many optimization problems encountered in the real-world have more than two objectives. To address such optimization problems, a number of evolutionary many-objective optimization algorithms were developed recently. In this paper, we tested 18 evolutionary many-objective algorithms against well-known combinatorial optimization problems, including knapsack problem (MOKP), traveling salesman problem (MOTSP), and quadratic assignment problem (mQAP), all up to 10 objectives. Results show that some of the dominance and reference-based algorithms such as non-dominated sort genetic algorithm (NSGA-III), strength Pareto-based evolutionary algorithm based on reference direction (SPEA/R), and Grid-based evolutionary algorithm (GrEA) are promising algorithms to tackle MOKP and MOTSP with 5 and 10 while increasing the number of objectives. Also, the dominance-based algorithms such as MaOEA-DDFC as well as the indicator-based algorithms such as HypE are promising to solve mQAP with 5 and 10 objectives. In contrast, decomposition based algorithms present the best on almost problems at saving time. For example, t-DEA displayed superior performance on MOTSP for up to 10 objectives.
Keyword:
NONDOMINATED SORTING APPROACH
DECOMPOSITION
DIVERSITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.1
论文数:
1.8K
被引数:
1.2W
机构
引用论文
PlatEMO: A MATLAB Platform for Evolutionary Multi-Objective OptimizationPlatEMO: 用于进化多目标优化的MATLAB平台OAAI
OAAI分享收藏Firm maternal parenting associated with decreased risk of excessive snacking in overweight childrenOAAI
OAAI分享收藏Multi-objective ant lion optimizer: a multi-objective optimization algorithm for solving engineering problems多目标蚁狮优化器: 一种求解工程问题的多目标优化算法.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
分享收藏
查看更多内容