A new class of operators to accelerate particle swarm optimization

We present some experiments with a new class of variations of mutation to accelerate the convergence of PSO. These robust mutation variations are tested on benchmark problems and the results show a significant improvement as compared to the original particle swarm optimization algorithm.

[1]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

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

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

[4]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[5]  David L. Woodruff,et al.  Hashing vectors for tabu search , 1993, Ann. Oper. Res..

[6]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

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