.png){kind=icon}
返回
Implicit enumeration strategies for the hypervolume subset selection problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2018.07.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The hypervolume subset selection problem arises within selection procedures of multiobjective evolutionary algorithms as well as for extracting a succinct subset of optimal solutions of a multiobjective optimization problem. Although efficient algorithms are known for two dimensions, this problem becomes NP-hard for more dimensions. In this article, we introduce an integer linear programming formulation for this problem for more than two dimensions that is based on the decomposition of the dominated region of the set of nondominated points. Moreover, we propose a branch and bound algorithm that uses combinatorial arguments and discuss bounding strategies based on the application of three upper bounds. We analyze the performance of the two solution approaches on a wide range of instances. The results indicate that the branch and bound algorithm has better performance for several orders of magnitude. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Hypervolume indicator
Branch and bound
Multiobjective optimization
Hypervolume subset selection problem
Integer linear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏
Yolk androstenedione, but not testosterone, predicts offspring fate and reflects parental quality
OAAI
OAAI分享收藏
查看更多内容