A box decomposition algorithm to compute the hypervolume indicator
From MaRDI portal
Publication:1652179
DOI10.1016/j.cor.2016.06.021zbMath1391.90557arXiv1510.01963OpenAlexW2962987192MaRDI QIDQ1652179
Renaud Lacour, Carlos M. Fonseca, Kathrin Klamroth
Publication date: 11 July 2018
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.01963
Integer programming (90C10) Multi-objective and goal programming (90C29) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (14)
What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization ⋮ Improved quick hypervolume algorithm ⋮ A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem ⋮ Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings ⋮ Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions ⋮ Twenty years of continuous multiobjective optimization in the twenty-first century ⋮ Density function-based trust region algorithm for approximating Pareto front of black-box multiobjective optimization problems ⋮ Lorenz dominance based algorithms to solve a practical multiobjective problem ⋮ Multi-Objective Evolutionary Algorithms: Past, Present, and Future ⋮ Fast hypervolume approximation scheme based on a segmentation strategy ⋮ Efficient computation of expected hypervolume improvement using box decomposition algorithms ⋮ On the use of polynomial models in multiobjective directional direct search ⋮ Implicit enumeration strategies for the hypervolume subset selection problem ⋮ Performance indicators in multiobjective optimization
Cites Work
- On the representation of the search region in multi-objective optimization
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- Fast calculation of multiobjective probability of improvement and expected improvement criteria for Pareto optimization
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Approximating the volume of unions and intersections of high-dimensional geometric objects
- Evolutionary multi-criterion optimization. 4th international conference, EMO 2007, Matsushima, Japan, March 5--8, 2007. Proceedings
- Efficient computation of the search region in multi-objective optimization
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Efficient Colored Orthogonal Range Counting
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A box decomposition algorithm to compute the hypervolume indicator
