Cover Image

Runtime Analysis of the Compact Genetic Algorithm on the LeadingOnes Benchmark

Fuente: arXiv

Saved in:

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

Similar Items

Difficulties of the NSGA-II with the Many-Objective LeadingOnes Problem
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)

Runtime Analysis for Multi-Objective Evolutionary Algorithms in Unbounded Integer Spaces
by: Doerr, Benjamin, 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)

Improved Runtime Guarantees for the SPEA2 Multi-Objective Optimizer
by: Doerr, Benjamin, 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)

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)

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

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

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)

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

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

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

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

Runtime Analysis for Permutation-based Evolutionary Algorithms
by: Doerr, Benjamin, et al.
Published: (2022)

Tail Bounds on the Runtime of Categorical Compact Genetic Algorithm
by: Hamano, Ryoki, et al.
Published: (2024)

Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Generalized OneMax
by: Adak, Sumit, et al.
Published: (2024)

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

A Flexible Evolutionary Algorithm With Dynamic Mutation Rate Archive
by: Krejca, Martin S., 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)

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

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

Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
by: Doerr, Carola, et al.
Published: (2023)

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus
by: Doerr, Benjamin, et al.
Published: (2023)

Improved Runtime Analysis of a Multi-Valued Compact Genetic Algorithm on Two Generalized OneMax Problems
by: Adak, Sumit, et al.
Published: (2025)

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

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

First Steps Towards a Runtime Analysis When Starting With a Good Solution
by: Antipov, Denis, et al.
Published: (2020)

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

An Extended Jump Functions Benchmark for the Analysis of Randomized Search Heuristics
by: Bambury, Henry, et al.
Published: (2021)

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

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

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

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

A Block-Coordinate Descent EMO Algorithm: Theoretical and Empirical Analysis
by: Doerr, Benjamin, et al.
Published: (2024)

How Sequential Algorithm Portfolios can benefit Black Box Optimization
by: Dinu, Catalin-Viorel, et al.
Published: (2026)

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

When Switching Algorithms Helps: A Theoretical Study of Online Algorithm Selection
by: Antipov, Denis, et al.
Published: (2026)

Impact of Training Instance Selection on Automated Algorithm Selection Models for Numerical Black-box Optimization
by: Dietrich, Konstantin, et al.
Published: (2024)