Faster hypervolume-based search using Monte Carlo sampling

DOI10.1007/978-3-642-04045-0_27MaRDI QIDQ3556573zbMATH OpenOpenAlexFDO

Authors Johannes Bader, Kalyanmoy Deb, Eckart Zitzler

Publication date 24 April 2010

Published in Lecture Notes in Economics and Mathematical Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04045-0_27

zbMATH Keywords

Monte Carlo samplinghypervolume indicatorevolutionary multiobjective algorithms

Mathematics Subject Classification ID

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

Recommendations

• Speeding up many-objective optimization by Monte Carlo approximations
• Approximation quality of the hypervolume indicator
• Fast hypervolume approximation scheme based on a segmentation strategy
• Don't be greedy when calculating hypervolume contributions
• Improved quick hypervolume algorithm

Cited in

(17)

• Speeding up many-objective optimization by Monte Carlo approximations
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation
• Robustness-based approach for fuzzy multi-objective problems
• Hypervolume maximization via set based Newton's method
• 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
• Many-objective optimization and hypervolume based search.
• Multi-objective optimization with an adaptive resonance theory-based estimation of distribution algorithm
• Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm
• Optimizing online recurring promotions for dual-channel retailers: segmented markets with multiple objectives
• Domination Measure: A New Metric for Solving Multiobjective Optimization
• A survey on multi-objective evolutionary algorithms for many-objective problems
• Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
• Fast hypervolume approximation scheme based on a segmentation strategy

Describes a project that uses

Uses Software

• PISA
• SPEA2

This page was built for publication: Faster hypervolume-based search using Monte Carlo sampling

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