Stagnation detection meets fast mutation
From MaRDI portal
Publication:5925610
DOI10.1016/j.tcs.2022.12.020OpenAlexW4313529954MaRDI QIDQ5925610
Benjamin Doerr, Amirhossein Rajabi
Publication date: 1 February 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.12.020
Related Items (2)
Choosing the right algorithm with hints from complexity theory ⋮ Runtime analysis for permutation-based evolutionary algorithms
Cites Work
- Unnamed Item
- When a genetic algorithm outperforms hill-climbing
- On the analysis of the \((1+1)\) evolutionary algorithm
- Does comma selection help to cope with local optima?
- Fast mutation in crossover-based algorithms
- Stagnation detection with randomized local search
- On crossing fitness valleys with majority-vote crossover and estimation-of-distribution algorithms
- Automatic adaptation of hypermutation rates for multimodal optimisation
- Stagnation detection meets fast mutation
This page was built for publication: Stagnation detection meets fast mutation