activity
20182025
most citedMathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)

84 citations · 339 across the 15 of their papers we have counts for

collaborators

15 papers

cs.NE2025

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…

cs.NE2024★ 1 cited

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…

cs.NE2024

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…

cs.NE2023★ 31 cited

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…

cs.NE2023★ 1 cited

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…

cs.NE2022★ 63 cited

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…

cs.NE2022★ 6 cited

From Understanding Genetic Drift to a Smart-Restart Mechanism for Estimation-of-Distribution Algorithms

Weijie Zheng, Benjamin Doerr

Estimation-of-distribution algorithms (EDAs) are optimization algorithms that learn a distribution on the search space from which good solutions can be sampled easily. A key parame…

cs.NE2022★ 22 cited

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)

Weijie Zheng, Benjamin Doerr

Recent theoretical works have shown that the NSGA-II efficiently computes the full Pareto front when the population size is large enough. In this work, we study how well it approxi…

cs.NE2021★ 84 cited

Mathematical Runtime Analysis for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)

Weijie Zheng, Benjamin Doerr

The non-dominated sorting genetic algorithm II (NSGA-II) is the most intensively used multi-objective evolutionary algorithm (MOEA) in real-world applications. However, in contrast…

cs.NE2021★ 11 cited

Choosing the Right Algorithm With Hints From Complexity Theory

Shouda Wang, Weijie Zheng, Benjamin Doerr

Choosing a suitable algorithm from the myriads of different search heuristics is difficult when faced with a novel optimization problem. In this work, we argue that the purely acad…

cs.NE2021

When Non-Elitism Meets Time-Linkage Problems

Weijie Zheng, Qiaozhi Zhang, Huanhuan Chen +1

Many real-world applications have the time-linkage property, and the only theoretical analysis is recently given by Zheng, et al. (TEVC 2021) on their proposed time-linkage OneMax…

cs.NE2020★ 17 cited

Analysis of Evolutionary Algorithms on Fitness Function with Time-linkage Property

Weijie Zheng, Huanhuan Chen, Xin Yao

In real-world applications, many optimization problems have the time-linkage property, that is, the objective function value relies on the current solution as well as the historica…

cs.NE2020★ 21 cited

From Understanding Genetic Drift to a Smart-Restart Parameter-less Compact Genetic Algorithm

Benjamin Doerr, Weijie Zheng

One of the key difficulties in using estimation-of-distribution algorithms is choosing the population size(s) appropriately: Too small values lead to genetic drift, which can cause…

cs.NE2019★ 54 cited

Sharp Bounds for Genetic Drift in Estimation of Distribution Algorithms

Benjamin Doerr, Weijie Zheng

Estimation of Distribution Algorithms (EDAs) are one branch of Evolutionary Algorithms (EAs) in the broad sense that they evolve a probabilistic model instead of a population. Many…

cs.NE2018★ 28 cited

Working Principles of Binary Differential Evolution

Benjamin Doerr, Weijie Zheng

We conduct a first fundamental analysis of the working principles of binary differential evolution (BDE), an optimization heuristic for binary decision variables that was derived b…