2014 | OriginalPaper | Buchkapitel
Empirical Performance of the Approximation of the Least Hypervolume Contributor
verfasst von : Krzysztof Nowak, Marcus Märtens, Dario Izzo
Erschienen in: Parallel Problem Solving from Nature – PPSN XIII
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
A fast computation of the hypervolume has become a crucial component for the quality assessment and the performance of modern multi-objective evolutionary optimization algorithms. Albeit recent improvements, exact computation becomes quickly infeasible if the optimization problems scale in their number of objectives or size. To overcome this issue, we investigate the potential of using approximation instead of exact computation by benchmarking the state of the art hypervolume algorithms for different geometries, dimensionality and number of points. Our experiments outline the threshold at which exact computation starts to become infeasible, but approximation still applies, highlighting the major factors that influence its performance.