31 citations · 35 across the 6 of their papers we have counts for
6 papers
Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
Mingfeng Li, Weijie Zheng, Benjamin Doerr
Different from single-objective evolutionary algorithms, where non-elitism is an established concept, multi-objective evolutionary algorithms almost always select the next populati…
The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
Renzhong Deng, Weijie Zheng, Benjamin Doerr
This work conducts a first theoretical analysis studying how well the NSGA-III approximates the Pareto front when the population size is less than the Pareto front size. We sho…
A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization
Weijie Zheng, Yao Gao, Benjamin Doerr
Recent theoretical works have shown that the NSGA-II can have enormous difficulties to solve problems with more than two objectives. In contrast, algorithms like the NSGA-III or SM…
Hyper-Heuristics Can Profit From Global Variation Operators
Benjamin Doerr, Johannes F. Lutzeyer
In recent work, Lissovoi, Oliveto, and Warwicker (Artificial Intelligence (2023)) proved that the Move Acceptance Hyper-Heuristic (MAHH) leaves the local optimum of the multimodal…
The Runtime of Random Local Search on the Generalized Needle Problem
Benjamin Doerr, Andrew James Kelley
In their recent work, C. Doerr and Krejca (Transactions on Evolutionary Computation, 2023) proved upper bounds on the expected runtime of the randomized local search heuristic on g…
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
Weijie Zheng, Benjamin Doerr
This paper conducts the first rigorous runtime analysis of the SMS-EMOA for many-objective optimization. To this aim, we first propose a many-objective counterpart of the bi-object…