Peer, E.S., Van den Bergh, F. and Engelbrecht A.P. (2003) Using neighbourhoods with the guaranteed convergence PSO. Proceeding of the IEEE Swarm Intelligence Sym-posium, 235-242.

has been cited by the following article:

• TITLE: A Modified Particle Swarm Optimization Algorithm

  AUTHORS: Ai-Qin Mu, De-Xin Cao, Xiao-Hua Wang

  KEYWORDS: PSO; Simulated Annealing Algorithm; Global Searching

  JOURNAL NAME: Natural Science, Vol.1 No.2, September 28, 2009

  ABSTRACT: Particle Swarm Optimization (PSO) is a new optimization algorithm, which is applied in many fields widely. But the original PSO is likely to cause the local optimization with premature convergence phenomenon. By using the idea of simulated annealing algo-rithm, we propose a modified algorithm which makes the most optimal particle of every time of iteration evolving continu-ously, and assign the worst particle with a new value to increase its disturbance. By the testing of three classic testing functions, we conclude the modified PSO algorithm has the better performance of convergence and global searching than the original PSO.