Cover Image

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Doerr, Benjamin, Korkotashvili, Dimitri, Krejca, Martin S.
Format:	Preprint
Published:	2024
Subjects:	Neural and Evolutionary Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark
by: Chwiałkowski, Marcel, et al.
Published: (2025)

Proven Approximation Guarantees in Multi-Objective Optimization: SPEA2 Beats NSGA-II
by: Alghouass, Yasser, et al.
Published: (2025)

Speeding Up the NSGA-II via Dynamic Population Sizes
by: Doerr, Benjamin, et al.
Published: (2025)

Speeding Up the NSGA-II With a Simple Tie-Breaking Rule
by: Doerr, Benjamin, et al.
Published: (2024)

A Crowding Distance That Provably Solves the Difficulties of the NSGA-II in Many-Objective Optimization
by: Zheng, Weijie, et al.
Published: (2024)

Runtime Analysis for the NSGA-II: Proving, Quantifying, and Explaining the Inefficiency For Many Objectives
by: Zheng, Weijie, et al.
Published: (2022)

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
by: Doerr, Benjamin, et al.
Published: (2025)

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
by: Doerr, Benjamin, et al.
Published: (2024)

Superior Genetic Algorithms for the Target Set Selection Problem Based on Power-Law Parameter Choices and Simple Greedy Heuristics
by: Doerr, Benjamin, et al.
Published: (2024)

A Runtime Analysis of the Multi-Valued Compact Genetic Algorithm on Generalized LeadingOnes
by: Adak, Sumit, et al.
Published: (2025)

Proven Runtime Guarantees for How the MOEA/D Computes the Pareto Front From the Subproblem Solutions
by: Doerr, Benjamin, et al.
Published: (2024)

Runtime Analysis of Evolutionary Diversity Optimization on the Multi-objective (LeadingOnes, TrailingZeros) Problem
by: Antipov, Denis, et al.
Published: (2024)

Runtime Analysis of the SMS-EMOA for Many-Objective Optimization
by: Zheng, Weijie, et al.
Published: (2023)

Estimation-of-Distribution Algorithms for Multi-Valued Decision Variables
by: Jedidia, Firas Ben, et al.
Published: (2023)

Near-Tight Runtime Guarantees for Many-Objective Evolutionary Algorithms
by: Wietheger, Simon, et al.
Published: (2024)

Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II)
by: Zheng, Weijie, et al.
Published: (2022)

Markov Chain-based Optimization Time Analysis of Bivalent Ant Colony Optimization for Sorting and LeadingOnes
by: Kergaßner, Matthias, et al.
Published: (2024)

The First Theoretical Approximation Guarantees for the Non-Dominated Sorting Genetic Algorithm III (NSGA-III)
by: Deng, Renzhong, et al.
Published: (2025)

A First Runtime Analysis of the NSGA-II on a Multimodal Problem
by: Doerr, Benjamin, et al.
Published: (2022)

On the Impact of Crossover in Many-Objective Optimization: A Runtime Analysis of NSGA-III
by: Opris, Andre
Published: (2026)

Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover
by: Doerr, Benjamin, et al.
Published: (2022)

A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive
by: Krejca, Martin S., et al.
Published: (2024)

Runtime Analysis of a Compact Genetic Algorithm on a Truly Multi-valued OneMax Function
by: Krejca, Martin S., et al.
Published: (2026)

Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives
by: Zheng, Weijie, et al.
Published: (2020)

Empirical Analysis of the Dynamic Binary Value Problem with IOHprofiler
by: Vermetten, Diederick, et al.
Published: (2024)

GPU-accelerated Evolutionary Many-objective Optimization Using Tensorized NSGA-III
by: Li, Hao, et al.
Published: (2025)

First Mathematical Runtime Analyses of Multi-Objective Evolutionary Algorithms for Multi-Valued Decision Variables
by: Li, Mingfeng, et al.
Published: (2026)

Tight Runtime Guarantees From Understanding the Population Dynamics of the GSEMO Multi-Objective Evolutionary Algorithm
by: Doerr, Benjamin, et al.
Published: (2025)

Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It
by: Antipov, Denis, et al.
Published: (2024)

Lower Bounds from Fitness Levels Made Easy
by: Doerr, Benjamin, et al.
Published: (2021)

Finding Low Star Discrepancy 3D Kronecker Point Sets Using Algorithm Configuration Techniques
by: Abderrahim, Imène Ait, et al.
Published: (2026)

MO-IOHinspector: Anytime Benchmarking of Multi-Objective Algorithms using IOHprofiler
by: Vermetten, Diederick, et al.
Published: (2024)

Algorithm Instance Footprint: Separating Easily Solvable and Challenging Problem Instances
by: Nikolikj, Ana, et al.
Published: (2023)

The Runtime of Random Local Search on the Generalized Needle Problem
by: Doerr, Benjamin, et al.
Published: (2024)

Many-Objective Neuroevolution for Testing Games
by: Feldmeier, Patric, et al.
Published: (2025)

A Memetic NSGA-III for Green Flexible Production with Real-Time Energy Costs & Emissions
by: Burmeister, Sascha C
Published: (2024)

Enhancing Parameter Control Policies with State Information
by: Covini, Gianluca, et al.
Published: (2025)

Multi-Objective Algorithms for Learning Open-Ended Robotic Problems
by: Robert, Martin, et al.
Published: (2024)

Already Moderate Population Sizes Provably Yield Strong Robustness to Noise
by: Antipov, Denis, et al.
Published: (2024)

Scalable Speed-ups for the SMS-EMOA from a Simple Aging Strategy
by: Li, Mingfeng, et al.
Published: (2025)