Runtime analysis for permutation-based evolutionary algorithms
From MaRDI portal
Publication:6185938
DOI10.1007/s00453-023-01146-8arXiv2207.04045OpenAlexW4385370574MaRDI QIDQ6185938
Yassine Ghannane, Benjamin Doerr, Marouane Ibn Brahim
Publication date: 9 January 2024
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2207.04045
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Runtime analysis of non-elitist populations: from classical optimisation to partial information
- Non-existence of linear universal drift functions
- Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
- Analyzing evolutionary algorithms. The computer science perspective.
- Combining Markov-chain analysis and drift analysis. The \((1+1)\) evolutionary algorithm on linear functions reloaded
- On the analysis of the \((1+1)\) evolutionary algorithm
- Sorting by swaps with noisy comparisons
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- The analysis of evolutionary algorithms -- A proof that crossover really can help
- Adaptive drift analysis
- A rigorous runtime analysis of the \((1 + (\lambda, \lambda))\) GA on jump functions
- Does comma selection help to cope with local optima?
- Self-adjusting evolutionary algorithms for multimodal optimization
- Fast mutation in crossover-based algorithms
- Multiplicative up-drift
- The runtime of the compact genetic algorithm on jump functions
- The choice of the offspring population size in the \((1,\lambda)\) evolutionary algorithm
- Expected runtimes of evolutionary algorithms for the Eulerian cycle problem
- An Experimental Study of Operator Choices in the $$(1+(\lambda ,\lambda ))$$ Genetic Algorithm
- Automatic adaptation of hypermutation rates for multimodal optimisation
- Self-adjusting offspring population sizes outperform fixed parameters on the cliff function
- Generating Random Derangements
- The benefits and limitations of voting mechanisms in evolutionary optimisation
- Theory of Evolutionary Computation
- Analysis of evolutionary algorithms
- Automata, Languages and Programming
- Introduction to evolutionary computing
- Stagnation detection meets fast mutation
- Drift analysis and average time complexity of evolutionary algorithms
- Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations
- Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
This page was built for publication: Runtime analysis for permutation-based evolutionary algorithms
