The Hypervolume Indicator: Computational Problems and Algorithms
TL;DR: The hypervolume indicator is one of the most used set-quality indicators for the assessment of stochastic multiobjective optimizers, as well as for selection in evolutionary multi-objective optimization algorithms as discussed by the authors.
read more
Abstract: The hypervolume indicator is one of the most used set-quality indicators for the assessment of stochastic multiobjective optimizers, as well as for selection in evolutionary multiobjective optimization algorithms. Its theoretical properties justify its wide acceptance, particularly the strict monotonicity with respect to set dominance, which is still unique of hypervolume-based indicators. This article discusses the computation of hypervolume-related problems, highlighting the relations between them, providing an overview of the paradigms and techniques used, a description of the main algorithms for each problem, and a rundown of the fastest algorithms regarding asymptotic complexity and runtime. By providing a complete overview of the computational problems associated to the hypervolume indicator, this article serves as the starting point for the development of new algorithms and supports users in the identification of the most appropriate implementations available for each problem.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A Pareto Corner Search Evolutionary Algorithm and Dimensionality Reduction in Many-Objective Optimization Problems
TL;DR: A novel algorithm, Pareto corner search evolutionary algorithm (PCSEA), is introduced in this paper, which searches for the corners of the PareTO front instead of searching for the complete Pare to front to identify the relevant objectives.
267
Distributed Cooperative Coevolution of Data Publishing Privacy and Transparency
TL;DR: This article defines the multi-objective data publishing (MODP) problem, optimizing data privacy and transparency at the same time, and proposes a distributed cooperative coevolutionary genetic algorithm (DCCGA) to optimize the MODP problem.
21
An approach based on genetic algorithms and neural networks for QoS-aware IoT services composition
TL;DR: In this paper , the authors proposed an approach based on genetic algorithms and neural networks for QoS-aware IoT services composition in the context of large-scale environments, where the combination between GA and NN allows finding the quasi-optimal IoT service composition.
15
Computing representations using hypervolume scalarizations
TL;DR: In this paper , the hypervolume indicator is used as a scalarizing function for biobjective combinatorial optimization problems and a generic solution approach that determines the nondominated set of a bi-objective optimization problem by solving a sequence of hypervolume scalarizations with appropriate choices of the reference point is described.
14
Multi-step wind speed prediction based on an improved multi-objective seagull optimization algorithm and a multi-kernel extreme learning machine
Xiuting Guo,Chang-sheng Zhu,Jie Hao,Shengcai Zhang +3 more
TL;DR: A hybrid prediction method for multi-step wind speed prediction based on the empirical wavelet transform, multi-objective modified seagull optimization algorithm, and multi-kernel extreme learning machine is proposed, demonstrating that the developed combined model outperforms the comparison models.
14
References
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Eckart Zitzler,Lothar Thiele +1 more
TL;DR: The proof-of-principle results obtained on two artificial problems as well as a larger problem, the synthesis of a digital hardware-software multiprocessor system, suggest that SPEA can be very effective in sampling from along the entire Pareto-optimal front and distributing the generated solutions over the tradeoff surface.
8.6K
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
TL;DR: This paper provides a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions and shows that elitism is shown to be an important factor for improving evolutionary multiobjectives search.
An analysis of approximations for maximizing submodular set functions--I
TL;DR: It is shown that a “greedy” heuristic always produces a solution whose value is at least 1 −[(K − 1/K]K times the optimal value, which can be achieved for eachK and has a limiting value of (e − 1)/e, where e is the base of the natural logarithm.
5.2K
•Book
Computational Geometry: An Introduction
Franco P. Preparata,Michael Ian Shamos +1 more
- 01 Jan 1978
TL;DR: In this article, the authors present a coherent treatment of computational geometry in the plane, at the graduate textbook level, and point out the way to the solution of the more challenging problems in dimensions higher than two.
4.5K