Adaptive control of acceleration coefficients for particle swarm optimization based on clustering analysis

Research into setting the values of the acceleration coefficients c1 and c2 in Particle Swarm Optimization (PSO) is one of the most significant and promising areas in evolutionary computation. Parameters c1 and c2 in PSO indicate the "self-cognitive" and "social-influence" components which are important for the ability to explore and converge respectively. Instead of using fixed value of c1 and c2 with 2.0, this paper presents the use of clustering analysis to adaptively adjust the value of these two parameters in PSO. By applying the K-means algorithm, distribution of the population in the search space is clustered in each generation. An adaptive system which is based on considering the relative size of the cluster containing the best particle and the one containing the worst particle is used to adjust the values of c1 and c2. The proposed method has been applied to optimize multidimensional mathematical functions, and the simulation results demonstrate that the proposed method performs with a faster convergence rate and better solutions when compared with the methods with fixed values of c1 and c2.

[1]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[2]  P. J. Angeline,et al.  Using selection to improve particle swarm optimization , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[3]  Yuhui Shi,et al.  Particle swarm optimization: developments, applications and resources , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[4]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..

[5]  Russell C. Eberhart,et al.  A new optimizer using particle swarm theory , 1995, MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science.

[6]  Chia-Feng Juang,et al.  A hybrid of genetic algorithm and particle swarm optimization for recurrent network design , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[7]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[8]  Jun Zhang,et al.  Clustering-Based Adaptive Crossover and Mutation Probabilities for Genetic Algorithms , 2007, IEEE Transactions on Evolutionary Computation.

[9]  Xin Yao,et al.  Evolutionary computation : theory and applications , 1999 .

[10]  Russell C. Eberhart,et al.  Multiobjective optimization using dynamic neighborhood particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[11]  James Kennedy,et al.  Particle swarm optimization , 1995, Proceedings of ICNN'95 - International Conference on Neural Networks.

[12]  Russell C. Eberhart,et al.  Comparison between Genetic Algorithms and Particle Swarm Optimization , 1998, Evolutionary Programming.

[13]  Rui Mendes,et al.  Neighborhood topologies in fully informed and best-of-neighborhood particle swarms , 2006 .

[14]  Marco Dorigo,et al.  Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[15]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[16]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.