Dynamic and adjustable particle swarm optimization

  • Authors:
  • Chen-Yi Liao;Wei-Ping Lee;Xianghan Chen;Cheng-Wen Chiang

  • Affiliations:
  • Department of Management Information System, Chung Yuan University, Taoyuan, Taiwan, R.O.C.;Department of Management Information System, Chung Yuan University, Taoyuan, Taiwan, R.O.C.;Department of Management Information System, Chung Yuan University, Taoyuan, Taiwan, R.O.C.;Department of Management Information System, Chung Yuan University, Taoyuan, Taiwan, R.O.C.

  • Venue:
  • EC'07 Proceedings of the 8th Conference on 8th WSEAS International Conference on Evolutionary Computing - Volume 8
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particle Swarm Optimization (PSO) is a stochastic, population-based evolutionary search technique. It has difficulties in controlling the balance between exploration and exploitation. In order to improve the performance of PSO and maintain the diversities of particles, we propose a novel algorithm called Dynamic and Adjustable Particle Swarm Optimization (DAPSO). The distance from each particle to the global best position is calculated in order to adjust the velocity suitably of each particle. Four benchmark functions such as Sphere, Rosenbrock, Rastrigrin, Griewank are used for the comparison of DAPSO with the Standard PSO. The experiments prove that DAPSO has better performance than the Standard PSO.