.png){kind=icon}
返回
Experimental analysis of design elements of scalarizing function-based multiobjective evolutionary algorithms
.png){kind=icon}
OA
AI
DOI：10.1007/s00500-018-3631-x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we systematically study the influence of the main design elements of scalarizing function-based multiobjective evolutionary algorithms (MOEAs) on the performance of these algorithms. Such algorithms proved to be very successful in multiple computational experiments and practical applications. Well-known examples of this class of MOEAs are Jaszkiewicz's multiobjecitve genetic local search and multiobjective evolutionary algorithm based on decomposition (MOEA/D). The two algorithms share the same common structure and differ in two aspects, i.e., the selection of parents for recombination and the selection of weight vectors of scalarizing functions. Using three different multiobjective combinatorial optimization problems, i.e., the multiobjective symmetric traveling salesperson problem, the traveling salesperson problem with profits, and the multiobjective set covering problem, we show that the design element with the highest influence on the performance is the choice of a mechanism for parents selection, while the selection of weight vectors, either random or evenly distributed, has practically negligible influence if the number of evenly distributed weight vectors is sufficiently large.
Keyword:
Metaheuristics
Multiobjective evolutionary algorithms
Combinatorial optimization
Traveling salesperson problem
Set covering problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
Enhanced Multiobjective Evolutionary Algorithm Based on Decomposition for Solving the Unit Commitment Problem基于分解的改进多目标进化算法求解机组组合问题OAAI
.png){kind=icon}
OAAI分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏分享收藏分享收藏分享收藏
查看更多内容