A new analysis of the LebMeasure algorithm for calculating hypervolume

DOI10.1007/978-3-540-31880-4_23MaRDI QIDQ5709897zbMATH OpenOpenAlexFDO

Authors Lyndon While

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106458

zbMATH Keywords

evolutionary computationhypervolumeMulti-objective optimisationperformance metrics

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A box decomposition algorithm to compute the hypervolume indicator
• Improved quick hypervolume algorithm
• Don't be greedy when calculating hypervolume contributions
• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
• The logarithmic hypervolume indicator

Cited in

(4)

• A box decomposition algorithm to compute the hypervolume indicator
• Improved quick hypervolume algorithm
• Adaptive ranks clone and k-nearest neighbor list-based immune multi-objective optimization
• SMS-EMOA: multiobjective selection based on dominated hypervolume

Describes a project that uses

Uses Software

• SPEA2

This page was built for publication: A new analysis of the LebMeasure algorithm for calculating hypervolume

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5709897)