Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2211.13084
Cited By
Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
23 November 2022
Weijie Zheng
Benjamin Doerr
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives"
18 / 18 papers shown
Title
Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
Benjamin Doerr
Martin S. Krejca
Andre Opris
24
0
0
02 May 2025
Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
Yasser Alghouass
Benjamin Doerr
Martin S. Krejca
Mohammed Lagmah
35
0
0
02 May 2025
A First Runtime Analysis of NSGA-III on a Many-Objective Multimodal Problem: Provable Exponential Speedup via Stochastic Population Update
Andre Opris
26
0
0
02 May 2025
The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
Renzhong Deng
Weijie Zheng
Benjamin Doerr
28
0
0
30 Apr 2025
Optimal Distribution of Solutions for Crowding Distance on Linear Pareto Fronts of Two-Objective Optimization Problems
H. Ishibuchi
Lie Meng Pang
43
0
0
24 Apr 2025
When to Truncate the Archive? On the Effect of the Truncation Frequency in Multi-Objective Optimisation
Zhiji Cui
Zimin Liang
Lie Meng Pang
H. Ishibuchi
Mingxing Li
33
0
0
02 Apr 2025
Multi-objective Pseudo Boolean Functions in Runtime Analysis: A Review
Zimin Liang
Mingxing Li
34
0
0
24 Mar 2025
An Archive Can Bring Provable Speed-ups in Multi-Objective Evolutionary Algorithms
Chao Bian
Shengjie Ren
Miqing Li
Chao Qian
35
4
0
04 Jun 2024
Illustrating the Efficiency of Popular Evolutionary Multi-Objective Algorithms Using Runtime Analysis
D. Dang
Andre Opris
Dirk Sudholt
25
2
0
22 May 2024
Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
Benjamin Doerr
Martin S. Krejca
Noé Weeks
31
2
0
02 May 2024
Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
Simon Wietheger
Benjamin Doerr
26
7
0
19 Apr 2024
Runtime Analyses of NSGA-III on Many-Objective Problems
Andre Opris
D. Dang
Frank Neumann
Dirk Sudholt
24
17
0
17 Apr 2024
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
Weijie Zheng
Benjamin Doerr
24
18
0
16 Dec 2023
Towards Running Time Analysis of Interactive Multi-objective Evolutionary Algorithms
Tianhao Lu
Chao Bian
Chao Qian
28
4
0
12 Oct 2023
Analysing the Robustness of NSGA-II under Noise
D. Dang
Andre Opris
B. Salehi
Dirk Sudholt
20
23
0
07 Jun 2023
Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary Algorithms
Chao Bian
Yawen Zhou
Mingxing Li
Chao Qian
13
33
0
05 Jun 2023
The First Proven Performance Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) on a Combinatorial Optimization Problem
Sacha Cerf
Benjamin Doerr
Benjamin Hebras
Yakob Kahane
Simon Wietheger
40
32
0
22 May 2023
A Mathematical Runtime Analysis of the Non-dominated Sorting Genetic Algorithm III (NSGA-III)
Simon Wietheger
Benjamin Doerr
22
35
0
15 Nov 2022
1