.png){kind=icon}
返回
A Set-Based Genetic Algorithm for Interval Many-Objective Optimization Problems
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2016.2634625.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Interval many-objective optimization problems (IMaOPs), involving more than three objectives and at least one subjected to interval uncertainty, are ubiquitous in real-world applications. However, there have been very few effective methods for solving these problems. In this paper, we proposed a set-based genetic algorithm to effectively solve them. The original optimization problem was first transformed into a deterministic bi-objective problem, where new objectives are hyper-volume and imprecision. A set-based Pareto dominance relation was then defined to modify the fast nondominated sorting approach in NSGA-II. Additionally, set-based evolutionary schemes were suggested. Finally, our method was empirically evaluated on 39 benchmark IMaOPs as well as a car cab design problem and compared with two typical methods. The numerical results demonstrated the superiority of our method and indicated that a tradeoff approximate front between convergence and uncertainty can be produced.
Keyword:
Genetic algorithm
interval
many-objective optimization
set-based evolution
uncertainty
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
A study of interval metric and its application in multi-objective optimization with interval objectives区间度量及其在区间目标多目标优化中的应用研究
.png){kind=icon}
PREAI
分享收藏Objective Extraction for Many-Objective Optimization Problems: Algorithm and Test Problems多目标优化问题的目标提取: 算法和测试问题
PREAI
分享收藏分享收藏分享收藏分享收藏
查看更多内容