Improved quick hypervolume algorithm
From MaRDI portal
Abstract: In this paper, we present a significant improvement of Quick Hypervolume algorithm, one of the state-of-the-art algorithms for calculating exact hypervolume of the space dominated by a set of d-dimensional points. This value is often used as a quality indicator in multiobjective evolutionary algorithms and other multiobjective metaheuristics and the efficiency of calculating this indicator is of crucial importance especially in the case of large sets or many dimensional objective spaces. We use a similar divide and conquer scheme as in the original Quick Hypervolume algorithm, but in our algorithm we split the problem into smaller sub-problems in a different way. Through both theoretical analysis and computational study we show that our approach improves computational complexity of the algorithm and practical running times.
Recommendations
Cites work
Cited in
(11)- Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings
- Efficient computation of expected hypervolume improvement using box decomposition algorithms
- Don't be greedy when calculating hypervolume contributions
- Performance indicators in multiobjective optimization
- Faster hypervolume-based search using Monte Carlo sampling
- Evolutionary Multi-Criterion Optimization
- Computing 3-D expected hypervolume improvement and related integrals in asymptotically optimal time
- A box decomposition algorithm to compute the hypervolume indicator
- What if we increase the number of objectives? Theoretical and empirical implications for many-objective combinatorial optimization
- Multi-Objective Evolutionary Algorithms: Past, Present, and Future
- Fast hypervolume approximation scheme based on a segmentation strategy
This page was built for publication: Improved quick hypervolume algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652507)
