Paper Info
Title
Quick extreme hypervolume contribution algorithm
Abstract
ABSTRACTWe propose a new algorithm for the extreme hypervolume contributor/contribution problem, i.e. the problem of finding the point with minimum/maximum contribution to the hypervolume and (optionally) the value of this extreme contribution. Our algorithm is motivated by the Improved Quick Hypervolume (IQHV) which works in a divide and conquer manner, and uses lower and upper bounds of the contribution to speed up calculations. It may be applied directly in multiobjective optimization methods that select solutions based on the extreme contribution to the hypervolume, or within the greedy algorithms for hypervolume subset selection problem often used in EMO. The proposed algorithm is the first dedicated algorithm for the maximum contribution problem and in the reported computational experiment it outperforms on most data sets state-of-the-art IWFG algorithm for the minimum contribution problem. We show that the proposed algorithm uses the lower and upper bounds very well by comparing it to a reference algorithm having an access to an oracle providing the best contributor in advance. We propose also a modification of the general IQHV algorithm scheme in which the order of objectives processing which influences construction of sub-problems is heuristically adapted and show that this modification improves the efficiency of the algorithm.
Year
DOI
Venue
2021
10.1145/3449639.3459394
Genetic and Evolutionary Computation Conference
Keywords
DocType
Citations 
multiobjective optimization, hypervolume
Conference
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
A. Jaszkiewicz166050.68
Piotr Zielniewicz21026.26