.png){kind=icon}
返回
A faster algorithm for calculating hypervolume
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2005.851275.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present an algorithm for calculating hypervolume exactly, the Hypervolume by Slicing Objectives (HSO) algorithm, that is faster than any that has previously been published. HSO processes objectives instead of points, an idea that has been considered before but that has never been properly evaluated in the literature. We show that both previously studied exact hypervolume algorithms are exponential in at least the number of objectives and that although HSO is also exponential in the number of objectives in the worst case, it runs in significantly less time, i.e., two to three orders of magnitude less for randomly generated and benchmark data in three to eight objectives. Thus, HSO increases the utility of hypervolume, both as a metric for general optimization algorithms and as a diversity mechanism for evolutionary algorithms.
Keyword:
evolutionary computation
hypervolume
multiobjective optimization
performance metrics
期刊
IF:
12
论文数:
1.8K
被引数:
2.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏分享收藏
查看更多内容