Limiting the velocity in particle swarm optimization using a geometric series

Since the introduction of the particle swarm optimization (PSO) algorithm, a considerable amount of research has been devoted to devise mechanisms that can control its possible premature convergence. The most common approach to deal with premature convergence in PSO consists of controlling (e.g., by limiting) the velocity of a particle. In this paper, we present a method that consists of limiting the velocity of a particle using the elements of a sequence of a geometric series. This approach is not only simplest than the current available methods, but also presents competitive results, and even better convergence in some cases, than two other PSO-based approaches. Additionally, the proposed approach provides more flexibility to balance between exploration or exploitation, through the tuning of a single parameter.

[1]  Jing J. Liang,et al.  Comprehensive learning particle swarm optimizer for global optimization of multimodal functions , 2006, IEEE Transactions on Evolutionary Computation.

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

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

[4]  W. Rudin Principles of mathematical analysis , 1964 .

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

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