Fast mutation in crossover-based algorithms
From MaRDI portal
Publication:2144278
DOI10.1007/s00453-022-00957-5OpenAlexW3016399834MaRDI QIDQ2144278
Benjamin Doerr, Maxim Buzdalov, Denis Antipov
Publication date: 1 June 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.06538
Related Items
The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm ⋮ Choosing the right algorithm with hints from complexity theory ⋮ Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution ⋮ An extended jump functions benchmark for the analysis of randomized search heuristics ⋮ Runtime analysis for permutation-based evolutionary algorithms ⋮ Using Automated Algorithm Configuration for Parameter Control ⋮ Stagnation detection meets fast mutation ⋮ Stagnation detection meets fast mutation
Cites Work
- Unnamed Item
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances
- From black-box complexity to designing new genetic algorithms
- When a genetic algorithm outperforms hill-climbing
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing evolutionary algorithms. The computer science perspective.
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- The interplay of population size and mutation probability in the \((1+\lambda )\) EA on OneMax
- Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions
- A tight runtime analysis for the (1 + (λ, λ)) GA on leadingones
- Theory of Evolutionary Computation
- Some Generalizations of the Theory of Cumulative Sums of Random Variables
- Drift analysis and average time complexity of evolutionary algorithms
