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

DOI10.1007/978-3-030-16711-0_8MaRDI QIDQ6084517zbMATH OpenOpenAlexFDO

Authors Alexander Raß, Jonas Schreiner, Rolf Wanka

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

discrete particle-swarm optimizationMarkov chainsruntime analysissingle-source shortest paths

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Analysis of algorithms (68W40) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
• Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
• Runtime analysis of a binary particle swarm optimizer
• Why standard particle swarm optimisers elude a theoretical runtime analysis
• scientific article; zbMATH DE number 6019552

Cites work

• Computing single source shortest paths using single-objective fitness
• Dynamic parameter control in simple evolutionary algorithms
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 2159383 (Why is no real title available?)
• Particle swarm optimization almost surely finds local optima
• Running time analysis of ant colony optimization for shortest path problems
• Runtime analysis of a binary particle swarm optimizer
• Runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax
• Runtime analysis of a simple ant colony optimization algorithm
• The analysis of evolutionary algorithms on sorting and shortest paths problems

Cited in

(2)

• Efficient computation of shortest paths in networks using particle swarm optimization and noising metaheuristics
• 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 of discrete particle swarm optimization applied to shortest paths computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084517)