The Effect of Rearrangement of the Most Incompatible Particle on Increase of Convergence Speed of PSO

This article presents a new method for increasing the speed of Particle Swarm Optimization ( PSO) method. The particle swarm is an optimization method that was inspired by collective movement of birds and fish looking for food. This method is composed of a group of particles: each particle tries to move in one direction that the best individual and best group of particles occur in that direction. Different articles tried to expand PSO so that global optimization is gained in less time. One of the problems of this model that occurs in most cases is falling of particles in local optimum. By finding the most incompatible particle and its rearrangement in the searching space, we increase convergence speed in some considered methods. Different tests of this method in standard searching space demonstrated that this method takes account of suitable function of increasing the convergece speed of particles. DOI: http://dx.doi.org/10.11591/ijece.v3i2.2026

[1]  Keiichiro Yasuda,et al.  Parameter self-adjusting strategy for Particle Swarm Optimization , 2011, 2011 11th International Conference on Intelligent Systems Design and Applications.

[2]  Cungen Cao,et al.  Multiplicate Particle Swarm Optimization Algorithm , 2010, J. Comput..

[4]  Jun Zhang,et al.  Adaptive Particle Swarm Optimization , 2008, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[5]  Russell C. Eberhart,et al.  Tracking and optimizing dynamic systems with particle swarms , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[6]  Ajith Abraham,et al.  Fuzzy adaptive turbulent particle swarm optimization , 2005, Fifth International Conference on Hybrid Intelligent Systems (HIS'05).

[7]  Nor Bahiah Hj. Ahmad,et al.  A comparative analysis of mining techniques for automatic detection of student's learning style , 2010, 2010 10th International Conference on Intelligent Systems Design and Applications.

[8]  Kusum Deep,et al.  A new fine grained inertia weight Particle Swarm Optimization , 2011, 2011 World Congress on Information and Communication Technologies.

[9]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[10]  Jun Zhang,et al.  Orthogonal Learning Particle Swarm Optimization , 2009, IEEE Transactions on Evolutionary Computation.