vix.ing · top · new · best · stats · spec

Quick HyperVolume

2012/07/19 by Luís M. S.​Russo, Luís M. S. Russo, Alexandre P. Francisco +2
Computer Science · #Advanced Multi-Objective Optimization Algorithms #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #Evolutionary Algorithms and Applications #FOS: Computer and information sciences #Metaheuristic Optimization Algorithms Research #Neural and Evolutionary Computing (cs.NE) #cs.DM #cs.DS #cs.NE

paper · pdf · doi:10.48550/arxiv.1207.4598

openalex publication_date 2012/07/19 · arxiv created 2012/11/29 · arxiv updated 2012/11/30 · openalex created_date 2024/04/11 · openalex updated_date 2026/07/28

Abstract

We present a new algorithm to calculate 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 (MOEAs). 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. A full description of the algorithm is currently submitted to IEEE Transactions on Evolutionary Computation.

Related