A self-adjusting compact genetic algorithm

DOI10.1007/978-3-032-20537-7_1MaRDI QIDQ7307376zbMATH OpenFDO

Authors Sumit Adak, Carsten Witt

Publication date 31 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-20537-7_1

Mathematics Subject Classification ID

Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A rigorous analysis of the compact genetic algorithm for linear functions
• A runtime analysis of the multi-valued compact genetic algorithm on generalized \textsc{LeadingOnes}
• Estimation-of-distribution algorithms for multi-valued decision variables
• First Steps Towards a Runtime Analysis of Neuroevolution
• scientific article; zbMATH DE number 1702339 (Why is no real title available?)
• Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
• Runtime analysis for self-adaptive mutation rates
• Scalable optimization via probabilistic modeling. From algorithms to applications.
• Self-adjusting mutation rates with provably optimal success rules
• The \((1+\lambda)\) evolutionary algorithm with self-adjusting mutation rate
• The complex parameter landscape of the compact genetic algorithm
• The runtime of the compact genetic algorithm on jump functions
• Theory of evolutionary computation. Recent developments in discrete optimization

This page was built for publication: A self-adjusting compact genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307376)