A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones

DOI10.1145/3299904.3340317zbMath1433.68641OpenAlexW2969267791MaRDI QIDQ5215490

Denis Antipov, Vitalii Karavaev, Benjamin Doerr

Publication date: 11 February 2020

Published in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3299904.3340317

zbMATH Keywords

crossoverruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (8)

A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions ⋮ Self-adjusting evolutionary algorithms for multimodal optimization ⋮ Fast mutation in crossover-based algorithms ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution ⋮ Curing ill-Conditionality via Representation-Agnostic Distance-Driven Perturbations ⋮ Using Automated Algorithm Configuration for Parameter Control ⋮ Working principles of binary differential evolution

This page was built for publication: A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones