Particle swarm optimization: Understanding order-2 stability guarantees

9Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper’s primary aim is to provide clarity on which guarantees about particle stability can actually be made. The particle swarm optimization algorithm has undergone a considerable amount of theoretical analysis. However, with this abundance of theory has come some terminological inconstancies, and as a result it is easy for a practitioner to be misguided by overloaded terminology. Specifically, the criteria for both order-1 and order-2 stability are well studied, but the exact definition of order-2 stability is not consistent amongst researchers. A consequence of this inconsistency in terminology is that the existing theory may in fact misguide practitioners instead of assisting them. In this paper it is theoretically and empirically demonstrated which practical guarantees can in fact be made about particle stability. Specifically, it is shown that the definition of order-2 stability which accurately reflects PSO behavior is that of convergence in second order moment to a constant, and not to zero.

Cite

CITATION STYLE

APA

Cleghorn, C. W. (2019). Particle swarm optimization: Understanding order-2 stability guarantees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11454 LNCS, pp. 535–549). Springer Verlag. https://doi.org/10.1007/978-3-030-16692-2_36

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free