Particle swarm optimisation is a metaheuristic algorithm which finds reasonable solutions in a wide range of applied problems if suitable parameters are used. We study the properties of the algorithm in the framework of random dynamical systems (RDS) which, due to the quasi-linear swarm dynamics, yields exact analytical results for the stability properties in the single particle case. The calculated stability region in the parameter space extends beyond the region determined by earlier approximations. This is also evidenced by simulations which indicate that the algorithm performs best in the asymptotic case if parameterised near the margin of instability predicted by the RDS approach.
CITATION STYLE
Erskine, A., Joyce, T., & Herrmann, J. M. (2016). Parameter selection in particle swarm optimisation from stochastic stability analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9882 LNCS, pp. 161–172). Springer Verlag. https://doi.org/10.1007/978-3-319-44427-7_14
Mendeley helps you to discover research relevant for your work.