Particle swarm optimization almost surely finds local optima

DOI10.1016/j.tcs.2014.05.017zbMath1303.68125OpenAlexW2067302411MaRDI QIDQ477085

Manuel Schmitt, Rolf Wanka

Publication date: 2 December 2014

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

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

zbMATH Keywords

particle swarm optimizationfitness landscapesquality of solution

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Zero-Inertia Limit: From Particle Swarm Optimization to Consensus-Based Optimization ⋮ Runtime analysis of discrete particle swarm optimization applied to shortest paths computation ⋮ On the global convergence of particle swarm optimization methods ⋮ Exact Markov chain-based runtime analysis of a discrete particle swarm optimization algorithm on sorting and OneMax ⋮ Particle swarm optimization almost surely finds local optima

Cites Work

• Unnamed Item
• Particle swarm optimization almost surely finds local optima
• Handbook of swarm intelligence. Concepts, principles and applications
• Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm
• Analysis of particle interaction in particle swarm optimization
• The particle swarm optimization algorithm: Convergence analysis and parameter selection
• Application of a particle swarm optimization algorithm for determining optimum well location and type
• Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
• Why standard particle swarm optimisers elude a theoretical runtime analysis
• Probability

This page was built for publication: Particle swarm optimization almost surely finds local optima