84 citations · 208 across the 10 of their papers we have counts for
15 papers
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…
Proven Advantage of Multiobjective Evolutionary Algorithms for Problems with Different Degrees of Conflict
Weijie Zheng
The field of multiobjective evolutionary algorithms (MOEAs) often emphasizes its popularity for optimization problems with conflicting objectives. However, it is still theoreticall…
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…
Theoretical Analyses of Evolutionary Algorithms on Time-Linkage OneMax with General Weights
Weijie Zheng, Xin Yao
Evolutionary computation has shown its superiority in dynamic optimization, but for the (dynamic) time-linkage problems, some theoretical studies have revealed the possible weaknes…
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
Weijie Zheng, Benjamin Doerr
The NSGA-II is one of the most prominent algorithms to solve multi-objective optimization problems. Despite numerous successful applications, several studies have shown that the NS…