Runtime Analysis of a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax

DOI10.1145/3040718.3040721zbMath1365.68394OpenAlexW2604246841MaRDI QIDQ5738852

Manuel Schmitt, Andreas Siegling, Rolf Wanka, Alexander Raß, Moritz Mühlenthaler

Publication date: 13 June 2017

Published in: Proceedings of the 14th ACM/SIGEVO Conference on Foundations of Genetic Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3040718.3040721

zbMATH Keywords

Markov chainsdiscrete optimizationparticle swarm optimizationruntime analysis

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Approximation methods and heuristics in mathematical programming (90C59) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Numerical aspects of recurrence relations (65Q30)

Related Items (2)

Runtime analysis of discrete particle swarm optimization applied to shortest paths computation ⋮ 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 a Discrete Particle Swarm Optimization Algorithm on Sorting and OneMax