Fast hypervolume approximation scheme based on a segmentation strategy

DOI10.1016/J.INS.2019.02.054MaRDI QIDQ1999059zbMATH OpenOpenAlexFDO

Authors Weisen Tang, Lei Chen, Kay Chen Tan, Yiu-ming Cheung, Hai-Lin Liu

Publication date 18 March 2021

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2019.02.054

zbMATH Keywords

evolutionary algorithmhypervolumemany-objective optimizationMonte Carlo simulation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Faster hypervolume-based search using Monte Carlo sampling
• Speeding up many-objective optimization by Monte Carlo approximations
• Improved quick hypervolume algorithm
• Approximation quality of the hypervolume indicator
• Don't be greedy when calculating hypervolume contributions

Cites work

• A box decomposition algorithm to compute the hypervolume indicator
• Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects
• Faster hypervolume-based search using Monte Carlo sampling
• scientific article; zbMATH DE number 1975103 (Why is no real title available?)
• SMS-EMOA: multiobjective selection based on dominated hypervolume

Cited in

(5)

• Improved quick hypervolume algorithm
• Faster hypervolume-based search using Monte Carlo sampling
• Speeding up many-objective optimization by Monte Carlo approximations
• Design and analysis of helper-problem-assisted evolutionary algorithm for constrained multiobjective optimization
• Adaptive nested Monte Carlo approach for multi-objective efficient global optimization

Describes a project that uses

Uses Software

• MOEA/D
• HypE
• SMS-EMOA
• weightedHypervolume
• jMetal

This page was built for publication: Fast hypervolume approximation scheme based on a segmentation strategy

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