Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

EMO
2005
Springer

favoriteEmaildiscussreport

175views Optimization» more EMO 2005»

A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume

13 years 10 months ago

A New Analysis of the LebMeasure Algorithm for Calculating Hypervolume

Download www.wfg.csse.uwa.edu.au

We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the number of objectives in the worst case, not polynomial as has been claimed previously. This result has important implications for anyone planning to use hypervolume, either as a metric to compare optimisation algorithms, or as part of a diversity mechanism in an evolutionary algorithm.

R. Lyndon While

Real-time Traffic

EMO 2005 | LebMeasure Algorithm | Polynomial | Worst Case |

claim paper

Related Content

» The logarithmic hypervolume indicator

» Incrementally maximising hypervolume for selection in multiobjective evolutionary algorith...

» Calculating a New Data Mining Algorithm for Market Basket Analysis

» Multiplicative approximations and the hypervolume indicator

» Discretization of functionally based heterogeneous objects

» Mixedinteger evolution strategy using multiobjective selection applied to warehouse design...

» An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks

» InParanoid 7 new algorithms and tools for eukaryotic orthology analysis

» A new approach to dynamics analysis of genetic algorithms without selection

Post Info
More Details (n/a)

Added	27 Jun 2010
Updated	27 Jun 2010
Type	Conference
Year	2005
Where	EMO
Authors	R. Lyndon While

Comments (0)