Quick HyperVolume

In this paper, we present a new algorithm for calculating exact hypervolumes. Given a set of d -dimensional points, it computes the hypervolume of the dominated space. Determining this value is an important subroutine of multiobjective evolutionary algorithms. We analyze the quick hypervolume (QHV) algorithm theoretically and experimentally. The theoretical results are a significant contribution to the current state of the art. Moreover, the experimental performance is also very competitive, compared with existing exact hypervolume algorithms.

Paper

Similar papers

© 2026 NYSGPT2525 LLC