Benchmarking a $(μ+λ)$ Genetic Algorithm with Configurable
Crossover Probability

Benchmarking a $(μ+λ)$ Genetic Algorithm with Configurable Crossover Probability

10 June 2020

Thomas Bäck

ArXiv (abs)PDF HTML

Papers citing "Benchmarking a $(μ+λ)$ Genetic Algorithm with Configurable Crossover Probability"

5 / 5 papers shown

Title
The Importance of Landscape Features for Performance Prediction of Modular CMA-ES Variants Ana Kostovska Diederick Vermetten Jannis Brugger Carola Doerr Peter Korošec T. Eftimov 52 9 0 15 Apr 2022
Automated Configuration of Genetic Algorithms by Tuning for Anytime Performance Furong Ye Carola Doerr Hao Wang Thomas Bäck 72 25 0 11 Jun 2021
Leveraging Benchmarking Data for Informed One-Shot Dynamic Algorithm Selection Furong Ye Carola Doerr Thomas Bäck 57 7 0 12 Feb 2021
Towards Large Scale Automated Algorithm Design by Integrating Modular Benchmarking Frameworks Amine Aziz-Alaoui Carola Doerr Johann Dréo 58 12 0 12 Feb 2021
Runtime Analysis of a Heavy-Tailed $(1+(λ,λ))$ Genetic Algorithm on Jump Functions Denis Antipov Benjamin Doerr 47 35 0 05 Jun 2020