A flexible evolutionary algorithm with dynamic mutation rate archive
From MaRDI portal
Cites work
- Adaptive drift analysis
- Black-box search by unbiased variation
- Drift analysis and average time complexity of evolutionary algorithms
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
- Fast mutation in crossover-based algorithms
- First-hitting times under drift
- Fitness levels with tail bounds for the analysis of randomized search heuristics
- How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
- scientific article; zbMATH DE number 1754585 (Why is no real title available?)
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- Multiplicative drift analysis
- On the impact of the performance metric on efficient algorithm configuration
- On the size of weights in randomized search heuristics
- Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
- Runtime analysis for permutation-based evolutionary algorithms
- Runtime analysis for self-adaptive mutation rates
- Self-adaptation Can Improve the Noise-tolerance of Evolutionary Algorithms
- Self-adjusting evolutionary algorithms for multimodal optimization
- Stagnation detection meets fast mutation
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Theory of evolutionary computation. Recent developments in discrete optimization
- When move acceptance selection hyper-heuristics outperform metropolis and elitist evolutionary algorithms and when not
This page was built for publication: A flexible evolutionary algorithm with dynamic mutation rate archive
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6894401)
