Particle Swarm Optimization with Dynamic Step Length

  • Authors:
  • Zhihua Cui;Xingjuan Cai;Jianchao Zeng;Guoji Sun

  • Affiliations:
  • Division of System Simulation and Computer Application, and Taiyuan University of Science and Technology, 030024, P.R. China;Division of System Simulation and Computer Application,;Division of System Simulation and Computer Application,;State Key Laboratory for Manufacturing Systems Engineering, Xi'an Jiaotong University, Xi'an, 710049, P.R. China

  • Venue:
  • ICIC '07 Proceedings of the 3rd International Conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Particle swarm optimization (PSO) is a robust swarm intelligent technique inspired from birds flocking and fish schooling. Though many effective improvements have been proposed, however, the premature convergence is still its main problem. Because each particle's movement is a continuous process and can be modelled with differential equation groups, a new variant, particle swarm optimization with dynamic step length (PSO-DSL), with additional control coefficient- step length, is introduced. Then the absolute stability theory is introduced to analyze the stability character of the standard PSO, the theoretical result indicates the PSO with constant step length can not always be stable, this may be one of the reason for premature convergence. Simulation results show the PSO-DSL is effective.