Greedy Decremental Quick Hypervolume Subset Selection Algorithms
[ 1 ] Instytut Informatyki, Wydział Informatyki i Telekomunikacji, Politechnika Poznańska | [ P ] employee
2022
chapter in monograph / paper
english
- Multiobjective optimization
- Hypervolume
- Greedy algorithms
EN The contribution of this paper is fourfold. First, we present an updated implementation of the Improved Quick Hypervolume algorithm which is several times faster than the original implementation and according to the presented computational experiment it is at least competitive to other state-of-the-art codes for hypervolume computation. Second, we present a Greedy Decremental Lazy Quick Hypervolume Subset Selection algorithm. Third, we propose a modified Quick Hypervolume Extreme Contributor/Contribution algorithm using bounds from previous iterations of a greedy hypervolume subset selection algorithm. According to our experiments these two methods perform the best for greedy decremental hypervolume subset selection. Finally, we systematically compare performance of the fastest algorithms for greedy incremental and decremental hypervolume subset selection using two criteria: CPU time and the quality of the selected subset.
164 - 178
20
140