Investigation of Particle Swarm Optimization Dynamics

In this work, a set of operators for a Particle Swarm (PS) based optimization algorithm is investigated for the purpose of finding optimal values for some of the classical benchmark problems. Particle swarm algorithms are implemented as mathematical operators inspired by the social behaviors of bird flocks and fish schools. In addition, particle swarm algorithms utilize a small number of relatively uncomplicated rules in response to complex behaviors, such that they are computationally inexpensive in terms of memory requirements and processing time. In particle swarm algorithms, particles in a continuous variable space are linked with neighbors, therefore the updated velocity means of particles influences the simulation results. The paper presents a statistical investigation on the velocity update rule for continuous variable PS algorithm. In particular, the probability density function influencing the particle velocity update is investigated along with the components used to construct the updated velocity vector of each particle within a flock. The simulation results of several numerical benchmark examples indicate that small amount of negative velocity is necessary to obtain good optimal values near global optimality.Copyright © 2007 by ASME

[1]  R. Eberhart,et al.  Comparing inertia weights and constriction factors in particle swarm optimization , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).

[2]  Chang-Hwan Im,et al.  Multimodal function optimization based on particle swarm optimization , 2006, IEEE Transactions on Magnetics.

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

[4]  José Neves,et al.  Watch thy neighbor or how the swarm can learn from its environment , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

[5]  Andries Petrus Engelbrecht,et al.  A study of particle swarm optimization particle trajectories , 2006, Inf. Sci..

[6]  Andries Petrus Engelbrecht,et al.  Locating multiple optima using particle swarm optimization , 2007, Appl. Math. Comput..

[7]  R. Eberhart,et al.  Empirical study of particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[8]  Leandro dos Santos Coelho,et al.  Coevolutionary Particle Swarm Optimization Using Gaussian Distribution for Solving Constrained Optimization Problems , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

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

[10]  Feng Shan,et al.  Study on a novel hybrid adaptive genetic algorithm embedding conjugate gradient algorithm , 2000, Proceedings of the 3rd World Congress on Intelligent Control and Automation (Cat. No.00EX393).

[11]  Gary B. Lamont,et al.  Visualizing particle swarm optimization - Gaussian particle swarm optimization , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).

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