Runtime analysis of discrete particle swarm optimization applied to shortest paths computation

DOI10.1007/978-3-030-16711-0_8zbMath1525.68213OpenAlexW2936813929MaRDI QIDQ6084517

Rolf Wanka, Jonas Schreiner, Alexander Raß

Publication date: 1 December 2023

Published in: Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-16711-0_8

zbMATH Keywords

Markov chainsruntime analysissingle-source shortest pathsdiscrete particle-swarm optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) 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)

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
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• Computing single source shortest paths using single-objective fitness
• Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Runtime analysis of discrete particle swarm optimization applied to shortest paths computation