Lasting Diversity and Superior Runtime Guarantees for the $(μ+1)$ Genetic Algorithm

24 February 2023

Papers citing "Lasting Diversity and Superior Runtime Guarantees for the $(μ+1)$ Genetic Algorithm"

7 / 7 papers shown

Title
Maintaining Diversity Provably Helps in Evolutionary Multimodal Optimization Shengjie Ren Zhijia Qiu Chao Bian Miqing Li Chao Qian 38 5 0 04 Jun 2024
How Population Diversity Influences the Efficiency of Crossover Sacha Cerf Johannes Lengler 16 0 0 18 Apr 2024
Runtime Analysis of the SMS-EMOA for Many-Objective Optimization Weijie Zheng Benjamin Doerr 30 18 0 16 Dec 2023
Improving Time and Memory Efficiency of Genetic Algorithms by Storing Populations as Minimum Spanning Trees of Patches M. Buzdalov 11 1 0 29 Jun 2023
Larger Offspring Populations Help the $(1 + (λ, λ))$ Genetic Algorithm to Overcome the Noise A. Ivanova Denis Antipov Benjamin Doerr 21 0 0 08 May 2023
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs Benjamin Doerr Arthur Dremaux J. Lutzeyer Aurélien Stumpf 18 5 0 20 Apr 2023
Runtime Analysis for the NSGA-II: Provable Speed-Ups From Crossover Benjamin Doerr Zhongdi Qu 15 43 0 18 Aug 2022