Center particle swarm optimization

  • Authors:
  • Yu Liu;Zheng Qin;Zhewen Shi;Jiang Lu

  • Affiliations:
  • Department of Computer Science and technology, Tsinghua University, Beijing 100084, P.R.China and Department of Computer Science, Xi'an Jiaotong University, Xi'an 710049, P.R.China;Department of Computer Science and technology, Tsinghua University, Beijing 100084, P.R.China and Department of Computer Science, Xi'an Jiaotong University, Xi'an 710049, P.R.China;Department of Computer Science, Xi'an Jiaotong University, Xi'an 710049, P.R.China;Department of Computer Science, Xi'an Jiaotong University, Xi'an 710049, P.R.China

  • Venue:
  • Neurocomputing
  • Year:
  • 2007

Quantified Score

Hi-index 0.02

Visualization

Abstract

Center particle swarm optimization algorithm (CenterPSO) is proposed where a center particle is incorporated into linearly decreasing weight particle swarm optimization (LDWPSO). Unlike other ordinary particles in LDWPSO, the center particle has no explicit velocity, and is set to the center of the swarm at every iteration. Other aspects of the center particle are the same as that of the ordinary particle, such as fitness evaluation and competition for the best particle of the swarm. Because the center of the swarm is a promising position, the center particle generally gets good fitness value. More importantly, due to frequent appearance as the best particle of swarm, it often attracts other particles and guides the search direction of the whole swarm. CenterPSO and LDWPSO are extensively compared on three well-known benchmark functions with 10, 20, 30 dimensions. Experimental results show that CenterPSO achieves not only better solutions but also faster convergence. Furthermore, CenterPSO and LDWPSO are compared as neural network training algorithms. The results show that CenterPSO achieves better performance than LDWPSO.