.png){kind=icon}
返回
A Fast Exact Algorithm for Computing the Hypervolume Contributions in 4-D Space
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2023.3271679.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The hypervolume (HV) contribution is widely used in indicator-based multiobjective algorithms. We propose an algorithm to compute exact 4-D HV contributions for a set of O(n([3/2])logn) time. Our algorithm improves the currently best time complexity O(n(2))byO(root n/logn) , and it is the first algorithm of subquadratic time for this problem. Our algorithm is built upon a space partition method in computational geometry and a geometric structure called the anchored gradient. We also propose a new space partition strategy to reduce the practical running time and the space overhead of this algorithm. Experimental results on a variety of test instances show that our proposed algorithm performs better than the existing state-of-the-art algorithm, especially, on point sets with cliff or other irregular properties.
Keyword:
Hypervolume (HV) contribution
Klee's measure problem (KMP)
multiobjective optimization
space partition method
Hypervolume (HV) contribution
Klee's measure problem (KMP)
multiobjective optimization
space partition method
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
F reticulocyte response in sickle cell anemia treated with recombinant human erythropoietin: a double-blind study.png)
Blood
OAAI
BloodIF0
OAAI分享收藏
查看更多内容