A convergence proof for the particle swarm optimiser

Show simple item record

dc.contributor.author Van den Bergh, Frans
dc.contributor.author Engelbrecht, Andries P.
dc.date.accessioned 2011-09-09T13:21:45Z
dc.date.available 2011-09-09T13:21:45Z
dc.date.issued 2010
dc.description.abstract The Particle Swarm Optimiser (PSO) is a population based stochastic optimisation algorithm, empirically shown to be efficient and robust. This paper provides a proof to show that the original PSO does not have guaranteed convergence to a local optimum. A flaw in the original PSO is identified which causes stagnation of the swarm. Correction of this flaw results in a PSO algorithm with guaranteed convergence to a local minimum. Further extensions with provable global convergence are also described. Experimental results are provided to elucidate the behavior of the modified PSO as well as PSO variations with global convergence. en_US
dc.description.uri http://www.iospress.nl/loadtop/load.php?isbn=01692968 en_US
dc.identifier.citation Van den Bergh, F & Engelbrecht, AP 2010, 'A convergence proof for the particle swarm optimiser', Fundamenta Informaticae, vol. 105, no. 4, pp. 341-374 en_US
dc.identifier.issn 0169-2968 (print)
dc.identifier.issn 1875-8681 (online)
dc.identifier.uri http://hdl.handle.net/2263/17262
dc.language.iso en en_US
dc.publisher IOS Pres en_US
dc.rights © 2011 by Polish Mathematical Society en_US
dc.subject Particle swarm optimization (PSO) en_US
dc.subject Convergence proofs en_US
dc.subject Stochastic optimisation en_US
dc.subject Local convergence en_US
dc.subject Global convergence en_US
dc.title A convergence proof for the particle swarm optimiser en_US
dc.type Postprint Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record