Runtime analysis of a binary particle swarm optimizer

DOI10.1016/j.tcs.2010.03.002zbMath1190.90292OpenAlexW2052328625WikidataQ57200637 ScholiaQ57200637MaRDI QIDQ974120

Dirk Sudholt, Carsten Witt

Publication date: 27 May 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.002

zbMATH Keywords

particle swarm optimizationruntime analysis

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items (9)

Reprint of: On convergence analysis of particle swarm optimization algorithm ⋮ Analysis of the \((1 + 1)\) EA on subclasses of linear functions under uniform and linear constraints ⋮ Runtime analysis of discrete particle swarm optimization applied to shortest paths computation ⋮ Running time analysis of ant colony optimization for shortest path problems ⋮ Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax ⋮ Do additional target points speed up evolutionary algorithms? ⋮ The use of tail inequalities on the probable computational time of randomized search heuristics ⋮ On convergence analysis of particle swarm optimization algorithm ⋮ Performance analysis of randomised search heuristics operating with a fixed budget

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rigorous analysis of the compact genetic algorithm for linear functions
• Minimum spanning trees made easier via multi-objective optimization
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Runtime analysis of a simple ant colony optimization algorithm
• Runtime analysis of ant colony optimization with best-so-far reinforcement
• On the analysis of the \((1+1)\) evolutionary algorithm
• The analysis of evolutionary algorithms on sorting and shortest paths problems
• A simple ant colony optimizer for stochastic shortest path problems
• A running time analysis of an ant colony optimization algorithm for shortest paths in directed acyclic graphs
• First steps to the runtime complexity analysis of ant colony optimization
• Why standard particle swarm optimisers elude a theoretical runtime analysis
• Probability Inequalities for Sums of Bounded Random Variables
• STACS 2005

This page was built for publication: Runtime analysis of a binary particle swarm optimizer