Particle Swarm Optimization with non-linear velocity

Particle Swarm Optimization (PSO), a population based optimization technique, has two intrinsic problems of slow convergence and tendency to converge prematurely. In order to overcome these problems, we propose an improvement to the velocity update equation of the standard PSO algorithm in which particles of a swarm tend to move towards the global best position more rapidly as compared to the local best position. Two different non-linear weight factors are multiplied with the two parts of the velocity update equation; one that tends to move the particle to the global best position, while the other tends to move the particle back to its local best position achieved so far. By introducing the separate weight factors, a significant improvement in the results is seen. We test the proposed algorithm on six benchmark functions and the simulation results are presented. The results indicate that the proposed algorithm does not converge prematurely and its convergence speed is faster than the standard PSO algorithm.

[1]  Farrukh Aslam Khan,et al.  A Hybrid Technique Using Multi-objective Particle Swarm Optimization and Random Forests for PROBE Attacks Detection in a Network , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.

[2]  Andries Petrus Engelbrecht,et al.  Cooperative learning in neural networks using particle swarm optimizers , 2000, South Afr. Comput. J..

[3]  Chu Kiong Loo,et al.  On the optimal control of the steel annealing processes as a two-stage hybrid systems via PSO algorithms , 2009, Int. J. Bio Inspired Comput..

[4]  ChunXia Zhao,et al.  Particle swarm optimization with adaptive population size and its application , 2009, Appl. Soft Comput..

[5]  Ioannis G. Tsoulos,et al.  Enhancing PSO methods for global optimization , 2010, Appl. Math. Comput..

[6]  Ying Tan,et al.  PERFORMANCE-DEPENDENT ADAPTIVE PARTICLE SWARM OPTIMIZATION , 2008 .

[7]  Ganesh K. Venayagamoorthy,et al.  Quantum inspired PSO for the optimization of simultaneous recurrent neural networks as MIMO learning systems , 2010, Neural Networks.

[8]  Xuhui Chen,et al.  A Hybrid Algorithm Based on PSO and Simulated Annealing and Its Applications for Partner Selection in Virtual Enterprise , 2005, ICIC.

[9]  Bing Lam Luk,et al.  Non-linear system identification using particle swarm optimisation tuned radial basis function models , 2009, Int. J. Bio Inspired Comput..

[10]  Wang Hu,et al.  A Simpler and More Effective Particle Swarm Optimization Algorithm , 2007 .

[11]  Farrukh Aslam Khan,et al.  Binary PSO and random forests algorithm for PROBE attacks detection in a network , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[12]  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).

[13]  Qingyuan He,et al.  An Improved Particle Swarm Optimization Algorithm with Disturbance Term , 2006, ICIC.

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

[15]  Shiyou Yang,et al.  A particle swarm optimization-based method for multiobjective design optimizations , 2005, IEEE Transactions on Magnetics.

[16]  Zhihua Cui,et al.  Particle swarm optimization with FUSS and RWS for high dimensional functions , 2008, Appl. Math. Comput..