.png){kind=icon}
返回
Improved quick hypervolume algorithm
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2017.09.016.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we present a significant improvement of the Quick Hypervolume algorithm, one of the state-of-the-art algorithms for calculating the exact hypervolume of the space dominated by a set of d-dimensional points. This value is often used as the quality indicator in the multiobjective evolutionary algorithms and other multiobjective metaheuristics and the efficiency of calculating this indicator is of crucial importance especially in the case of large sets or many dimensional objective spaces. We use a similar divide and conquer scheme as in the original Quick Hypervolume algorithm, but in our algorithm we split the problem into smaller sub-problems in a different way. Through both theoretical analysis and a computational study we show that our approach improves the computational complexity of the algorithm and practical running times. (c) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Multiobjective optimization
Hypervolume indicator
Computational complexity analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
分享收藏A Simple and Fast Hypervolume Indicator-Based Multiobjective Evolutionary Algorithm一种简单快速的基于超体积指标的多目标进化算法
PREAI
分享收藏分享收藏
查看更多内容