×

The particle swarm optimization algorithm: Convergence analysis and parameter selection. (English) Zbl 1156.90463

Summary: The particle swarm optimization algorithm is analyzed using standard results from the dynamic system theory. Graphical parameter selection guidelines are derived. The exploration-exploitation tradeoff is discussed and illustrated. Examples of performance on benchmark functions superior to previously published results are given.

MSC:

90C59 Approximation methods and heuristics in mathematical programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Clerc, M., The swarm and the queen: towards a deterministic and adaptive particle swarm optimization, (Proc. ICEC, Washington, DC (1999)), 1951-1957
[2] Clerc, M.; Kennedy, J., The particle swarm: explosion stability and convergence in a multi-dimensional complex space, IEEE Trans. Evolution. Comput., 6, 1, 58-73 (2002)
[3] Eberhart, R. C.; Shi, Y., Comparing inertia weights and constriction factors in particle swarm optimization, (Proc. CEC, San Diego, CA (2000)), 84-88
[4] Kennedy, J.; Eberhart, R. C., Particle swarm optimization, (Proc. IEEE Conf. on Neural Networks, IV, Piscataway, NJ (1995)), 1942-1948
[5] Kennedy, J.; Eberhart, R. C.; Shi, Y., Swarm Intelligence (2001), Morgan Kaufmann Publishers: Morgan Kaufmann Publishers San Francisco, CA
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.