2006 | OriginalPaper | Chapter
A Comparison of Particle Swarm Optimization Algorithms Based on Run-Length Distributions
Authors : Marco A. Montes de Oca, Thomas Stützle, Mauro Birattari, Marco Dorigo
Published in: Ant Colony Optimization and Swarm Intelligence
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
In this paper we report an empirical comparison of some of the most influential Particle Swarm Optimization (PSO) algorithms based on run-length distributions (RLDs). The advantage of our approach over the usual report pattern (average iterations to reach a predefined goal, success rates, and standard deviations) found in the current PSO literature is that it is possible to evaluate the performance of an algorithm on different application scenarios at the same time. The RLDs reported in this paper show some of the strengths and weaknesses of the studied algorithms and suggest ways of improving their performance.