Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
DOI10.1007/s11047-021-09856-0zbMath1530.68282arXiv1902.01810MaRDI QIDQ6177181
Moritz Mühlenthaler, Rolf Wanka, Manuel Schmitt, Alexander Raß
Publication date: 31 August 2023
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.01810
Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Searching and sorting (68P10) Approximation methods and heuristics in mathematical programming (90C59) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (1)
Cites Work
- Running time analysis of ant colony optimization for shortest path problems
- Particle swarm optimization almost surely finds local optima
- Runtime analysis of a binary particle swarm optimizer
- Runtime analysis of a simple ant colony optimization algorithm
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- On the analysis of the \((1+1)\) evolutionary algorithm
- The analysis of evolutionary algorithms on sorting and shortest paths problems
- Application of a particle swarm optimization algorithm for determining optimum well location and type
- Sorting by Transpositions
- Equation of State Calculations by Fast Computing Machines
- Theory of Evolutionary Computation
- Probability and Computing
- Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax
- Probability
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
