no code implementations • 19 Jun 2024 • Frank Neumann, Günter Rudolph
Constrained submodular optimization problems play a key role in the area of combinatorial optimization as they capture many NP-hard optimization problems.
no code implementations • 28 May 2020 • Jakob Bossek, Christian Grimme, Günter Rudolph, Heike Trautmann
Therein, the distance traveled by a single vehicle and the number of unserved dynamic requests is minimized by a dynamic evolutionary multi-objective algorithm (DEMOA), which operates on discrete time windows (eras).
no code implementations • 10 Jul 2018 • Martin Zaefferer, Thomas Bartz-Beielstein, Günter Rudolph
We provide a proof-of-concept with 16 different distance measures for permutations.
no code implementations • 1 Nov 2016 • Vanessa Volz, Günter Rudolph, Boris Naujoks
In this paper, we propose a novel approach (SAPEO) to support the survival selection process in multi-objective evolutionary algorithms with surrogate models - it dynamically chooses individuals to evaluate exactly based on the model uncertainty and the distinctness of the population.
no code implementations • 11 Mar 2016 • Vanessa Volz, Günter Rudolph, Boris Naujoks
In this paper, the feasibility of automatic balancing using simulation- and deck-based objectives is investigated for the card game top trumps.
no code implementations • 26 Mar 2015 • Luis Marti, Christian Grimme, Pascal Kerschke, Heike Trautmann, Günter Rudolph
Therefore, we propose a postprocessing strategy which consists of applying the averaged Hausdorff indicator to the complete archive of generated solutions after optimization in order to select a uniformly distributed subset of nondominated solutions from the archive.