André Deutz

André Deutz


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 May 2018 in Natural Computing
Verified
Journal Article
Open access
PDF file
MEMichael T. M. Emmerich
Michael T. M. Emmerich
ADAndré Deutz
André Deutz
In almost no other field of computer science, the idea of using bio-inspired search paradigms has been so useful as in solving multiobjective optimization problems. The idea of using a population of search agents that collectively approximate the Pareto front resonates well with processes in natural evolution, immune systems, and swarm intelligence. Methods such as NSGA-II, SPEA2, SMS-EMOA, MOPSO, and MOEA/D became standard solvers when it comes to solving multiobjective optimization problems. This tutorial will review some of the most important fundamentals in multiobjective optimization and then introduce representative algorithms, illustrate their working principles, and discuss their application scope. In addition, the tutorial will discuss statistical performance assessment. Finally, it highlights recent important trends and closely related research fields. The tutorial is intended for readers, who want to acquire basic knowledge on the mathematical foundations of multiobjective optimization and state-of-the-art methods in evolutionary multiobjective optimization. The aim is to provide a starting point for researching in this active area, and it should also help the advanced reader to identify open research topics.

3 July 2019 in Journal of Global Optimization
Verified
Journal Article
Open access
PDF file
KYKaifeng Yang
Kaifeng Yang
MEMichael Emmerich
Michael Emmerich
ADAndré Deutz
André Deutz
Thomas BäckThomas Bäck
Thomas Bäck
In the field of multi-objective optimization algorithms, multi-objective Bayesian Global Optimization (MOBGO) is an important branch, in addition to evolutionary multi-objective optimization algorithms. MOBGO utilizes Gaussian Process models learned from previous objective function evaluations to decide the next evaluation site by maximizing or minimizing an infill criterion. A commonly used criterion in MOBGO is the Expected Hypervolume Improvement (EHVI), which shows a good performance on a wide range of problems, with respect to exploration and exploitation. However, so far, it has been a challenge to calculate exact EHVI values efficiently. This paper proposes an efficient algorithm for the exact calculation of the EHVI for in a generic case. This efficient algorithm is based on partitioning the integration volume into a set of axis-parallel slices. Theoretically, the upper bound time complexities can be improved from previously \(O (n^2)\) and \(O(n^3)\), for two- and three-objective problems respectively, to \(\varTheta (n\log n)\), which is asymptotically optimal. This article generalizes the scheme in higher dimensional cases by utilizing a new hyperbox decomposition technique, which is proposed by Dächert et al. (Eur J Oper Res 260(3):841–855, 2017). It also utilizes a generalization of the multilayered integration scheme that scales linearly in the number of hyperboxes of the decomposition. The speed comparison shows that the proposed algorithm in this paper significantly reduces computation time. Finally, this decomposition technique is applied in the calculation of the Probability of Improvement (PoI).

5 November 2016
Verified
Book Chapter
Closed access
PDF file
MEMichael Emmerich
Michael Emmerich
KYKaifeng Yang
Kaifeng Yang
ADAndré Deutz
André Deutz
Hao WangHao Wang
Hao Wang
CFCarlos M. Fonseca
Carlos M. Fonseca

1 December 2021 in Computers & Operations Research
Verified
Journal Article
Closed access
CGChristian Grimme
Christian Grimme
PKPascal Kerschke
Pascal Kerschke
PAPelin Aspar
Pelin Aspar
HTHeike Trautmann
Heike Trautmann
MPMike Preuss
Mike Preuss
MEMichael Emmerich
Michael Emmerich

1 December 2019 in Evolutionary Computation
Verified
Journal Article
Closed access
PKP. Kerschke
P. Kerschke
Hao WangHao Wang
Hao Wang
MPM. Preuss
M. Preuss
CGC. Grimme
C. Grimme
ADAndré Deutz
André Deutz
MEM. T. M. Emmerich
M. T. M. Emmerich
MIT Press Journals is a mission-driven, not-for-profit scholarly publisher devoted to the widest dissemination of its content.

27 September 2024 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Open access
Hao WangHao Wang
Hao Wang
ARAngel E. Rodriguez-Fernandez
Angel E. Rodriguez-Fernandez
Lourdes UribeLourdes Uribe
Lourdes Uribe
ADAndré Deutz
André Deutz
OCOziel Cortés-Piña
Oziel Cortés-Piña
OSOliver Schütze
Oliver Schütze
A common goal in evolutionary multi-objective optimization is to find suitable finite-size approximations of the Pareto front of a given multi-objective optimization problem. While many multi-objective evolutionary algorithms have proven to be very efficient in finding good Pareto front approximations, they may need quite a few resources or may even fail to obtain optimal or nearly optimal approximations. Hereby, optimality is implicitly defined by the chosen performance indicator In this work, we propose a set-based Newton method for Hausdorff approximations of the Pareto front to be used within multi-objective evolutionary algorithms. To this end, we first generalize the previously proposed Newton step for the performance indicator to treat constrained problems for general reference sets. To approximate the target Pareto front, we propose a particular strategy for generating the reference set that utilizes the data gathered by the evolutionary algorithm during its run. Finally, we show the benefit of the Newton method as a post-processing step on several benchmark test functions and different base evolutionary algorithms.