A Flexible Evolutionary Algorithm with Dynamic Mutation Rate Archive
- 13 November 2025
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 88 (1) , 5
Abstract
No abstract availableKeywords
Funding Information
- Fondation Mathématique Jacques Hadamard
This publication has 51 references indexed in Scilit:
- Runtime Analysis of a Heavy-Tailed $(1+(\lambda ,\lambda ))$ Genetic Algorithm on Jump Functions2020
- Fast Perturbative Algorithm Configurators2020
- Theory of Evolutionary Computation2020
- Heavy-Tailed Mutation Operators in Single-Objective Combinatorial Optimization2018
- Dynamic Mutation Based Pareto Optimization for Subset Selection2018
- k-Bit Mutation with Self-Adjusting k Outperforms Standard Bit Mutation2016
- Self-adaptation of Mutation Rates in Non-elitist Populations2016
- Sequential Model-Based Optimization for General Algorithm Configuration2011
- The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can HelpAlgorithmica, 2002
- Theoretical Aspects of Evolutionary Algorithms2001