Faster Hypervolume-Based Search Using Monte Carlo Sampling

DOI10.1007/978-3-642-04045-0_27zbMath1184.90147OpenAlexW1817091417MaRDI QIDQ3556573

Eckart Zitzler, Kalyanmoy Deb, Johannes Bader

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)

Related Items

Robustness-based approach for fuzzy multi-objective problems ⋮ Multi-objective optimization with an adaptive resonance theory-based estimation of distribution algorithm ⋮ 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 ⋮ A Pareto-based many-objective evolutionary algorithm using space partitioning selection and angle-based truncation ⋮ 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

Uses Software

• PISA
• SPEA2

This page was built for publication: Faster Hypervolume-Based Search Using Monte Carlo Sampling