Quick HyperVolume

07/19/2012
by   Luís M. S. Russo, et al.
0

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.

READ FULL TEXT
research
12/11/2016

Improved Quick Hypervolume Algorithm

In this paper, we present a significant improvement of Quick Hypervolume...
research
04/15/2020

Improving Many-objective Evolutionary Algorithms by Means of Expanded Cone Orders

Given a point in m-dimensional objective space, the local environment of...
research
04/14/2018

On Asynchronous Non-Dominated Sorting for Steady-State Multiobjective Evolutionary Algorithms

In parallel and distributed environments, generational evolutionary algo...
research
05/01/2018

Multiobjective Optimization Differential Evolution Enhanced with Principle Component Analysis for Constrained Optimization

Multiobjective optimization evolutionary algorithms have been successful...
research
12/04/2022

Can Evolutionary Clustering Have Theoretical Guarantees?

Clustering is a fundamental problem in many areas, which aims to partiti...
research
05/22/2018

copMEM: Finding maximal exact matches via sampling both genomes

Genome-to-genome comparisons require designating anchor points, which ar...
research
10/12/2018

Why We Do Not Evolve Software? Analysis of Evolutionary Algorithms

In this paper, we review the state-of-the-art results in evolutionary co...

Please sign up or login with your details

Forgot password? Click here to reset