J4 ›› 2012, Vol. 39 ›› Issue (4): 74-80.doi: 10.3969/j.issn.1001-2400.2012.04.014

• Original Articles • Previous Articles     Next Articles

Adaptive particle swarm optimization via disturbing  acceleration coefficents

JIANG Jianguo1;TIAN Min1;WANG Xiangqian2;LONG Xiuping1;LI Jin1   

  1. (1. School of Computer Science and Technology, Xidian Univ., Xi'an  710071, China;
    2. Pingdingshan Univ. Normal Edu. Faculty, Pingdingshan  467002, China)
  • Received:2011-04-08 Online:2012-08-20 Published:2012-10-08
  • Contact: JIANG Jianguo E-mail:jgjiang@mail.xidian.edu.cn

Abstract:

The Particle Swarm Optimization (PSO) is an evolutionary method which is used to search for the global optimal solution by iteration. However, PSO has the problem that the particle swarm algorithm falls easily into premature convergence and has a low search efficiency. In this paper, after analyzing several existing improved particle swarm algorithms, a new improved particle swarm algorithm is proposed based on the fact that symmetrical particles distribution can enhance the optimation search results. The proposed algorithm can adjust the inertia weight factor adaptively in different phases of the process according to the variation of the cosine function. In addition, the acceleration coefficents based on linear variation are disturbed under a certain condition. Moreover, an appropriate value of the parameter in this condition is determined via experiments. Several classic functions have been used to test this new algorithm and then the results of this new algorithm are analyzed by comparing it with several relevant algorithms in the literature. The results show that this new algorithm can not only improve the convergence speed significantly, but also improve the premature convergence phenomenon.

Key words: particle swarm optimization, acceleration coefficents, inertia weight factor

CLC Number: 

  • TP301.6

Baidu
map