A new analysis of the LebMeasure algorithm for calculating hypervolume

    Research output: Contribution to journalArticle

    32 Citations (Scopus)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)326-340
    JournalLecture Notes in Computer Science
    Volume3410
    Publication statusPublished - 2005

    Fingerprint Dive into the research topics of 'A new analysis of the LebMeasure algorithm for calculating hypervolume'. Together they form a unique fingerprint.

  • Cite this