Achieving tight O(4ᵏ) runtime bounds on Jump_k by proving that genetic algorithms evolve near-maximal population diversity
From MaRDI portal
Publication:6926526
Cites work
- An extended jump functions benchmark for the analysis of randomized search heuristics
- Analysing equilibrium states for population diversity
- Analyzing evolutionary algorithms. The computer science perspective.
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Black-box Complexity of Parallel Search with Distributed Populations
- Black-box search by unbiased variation
- How majority-vote crossover and estimation-of-distribution algorithms cope with fitness valleys
- scientific article; zbMATH DE number 2040668 (Why is no real title available?)
- Landscapes, operators and heuristic search
- Memetic algorithms outperform evolutionary algorithms in multimodal optimisation
- Optimal parameter choices via precise black-box analysis
- Stagnation detection in highly multimodal fitness landscapes
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- The benefits and limitations of voting mechanisms in evolutionary optimisation
- Theory of evolutionary computation. Recent developments in discrete optimization
- Tight bounds on the expected runtime of a standard steady state genetic algorithm
- When a genetic algorithm outperforms hill-climbing
This page was built for publication: Achieving tight \(O(4^k)\) runtime bounds on \(\textsc{Jump}_k\) by proving that genetic algorithms evolve near-maximal population diversity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926526)
