Runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax

DOI10.1145/3040718.3040721MaRDI QIDQ5738852zbMATH OpenOpenAlexFDO

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

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

discrete optimizationMarkov chainsparticle swarm optimizationruntime analysis

Mathematics Subject Classification ID

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

Recommendations

• Runtime analysis of a binary particle swarm optimizer
• Why standard particle swarm optimisers elude a theoretical runtime analysis
• scientific article; zbMATH DE number 6019552
• scientific article; zbMATH DE number 5811277
• Analytic solution of the continuous particle swarm optimization problem

Cited in

(4)

• Why standard particle swarm optimisers elude a theoretical runtime analysis
• 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
• Runtime analysis of a binary particle swarm optimizer

This page was built for publication: Runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax

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