A Fast Way of Calculating Exact Hypervolumes
Authors:
Top Cited Papers
- 12 May 2011
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Evolutionary Computation
- Vol. 16 (1) , 86-95
Abstract
We describe a new algorithm WFG for calculating hypervolume exactly. WFG is based on the recently-described observation that the exclusive hypervolume of a point p relative to a set S is equal to the difference between the inclusive hypervolume of p and the hypervolume of S with each point limited by the objective values in p. WFG applies this technique iteratively over a set to calculate its hypervolume. Experiments show that WFG is substantially faster (in five or more objectives) than all previously-described algorithms that calculate hypervolume exactly.Keywords
This publication has 23 references indexed in Scilit:
- S-Metric Calculation by Considering Dominated Hypervolume as Klee's Measure ProblemEvolutionary Computation, 2009
- Faster Hypervolume-Based Search Using Monte Carlo Sampling2009
- Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice2009
- An EMO Algorithm Using the Hypervolume Measure as Selection Criterion2005
- A New Analysis of the LebMeasure Algorithm for Calculating HypervolumeLecture Notes in Computer Science, 2005
- Scalable multi-objective optimization test problems2003
- Performance assessment of multiobjective optimizers: an analysis and reviewIEEE Transactions on Evolutionary Computation, 2003
- Properties of an adaptive archiving algorithm for storing nondominated vectorsIEEE Transactions on Evolutionary Computation, 2003
- The Measure of Pareto Optima Applications to Multi-objective Metaheuristics2003
- Metrics for Quality Assessment of a Multiobjective Design Optimization Solution SetJournal of Mechanical Design, 2000