Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax.
Moritz MühlenthalerAlexander RaßManuel SchmittRolf WankaPublished in: Nat. Comput. (2022)
Keyphrases
- markov chain
- particle swarm optimization algorithm
- markov model
- steady state
- monte carlo method
- markov process
- monte carlo simulation
- convergence speed
- transition probabilities
- random walk
- particle swarm optimization
- state space
- monte carlo
- stationary distribution
- finite state
- support vector
- pso algorithm
- markov models
- search space