ABSTRACT
A novel particle swarm optimization with triggered mutation (PSO-TM) is presented in this paper for better performance. First, a technique is designed to evaluate the "health" of swarm. When the swarm is successively "unhealthy" for a certain number of iterations, uniform mutation is applied to the position of each particle in a probabilistic way. If the mutations produce worse particles, the memorized previous positions are retrieved as current positions of these particles, hence the normal evolution process of the swarm will not be fiercely interrupted by such bad mutations. Experiments are conducted on 29 benchmark test functions to show the promising performance of our proposed PSOTM. The results show that the PSO-TM performs much better than the standard PSO on almost all of the 29 test functions, especially those multimodal, complex ones of hybrid composition. Besides, PSO-TM adds little computation complexity to the standard PSO, and runs almost equally fast. Furthermore, we have implemented PSO-TM based on Graphic Processing Unit(GPU) in parallel. Compared with the CPU-based standard PSO, the proposed PSO-TM can reach a speedup of 25×, as well as an improved optimizing performance.
- J. Kennedy and R. C. Eberhart, Particle Swarm Optimization, in Proceedings of IEEE International Conference on Neural Networks, vol. IV, (Perth,Australia), pp. 1942--1948, IEEE Service Center,Piscataway, NJ, 1995.Google ScholarCross Ref
- D. Bratton, J. Kennedy, Defining a Standard for Particle Swarm Optimization, IEEE Swarm Intelligence Symposium, April 2007, pp.120--127.Google Scholar
- You Zhou, Ying Tan, GPU-based parallel particle swarm optimization, IEEE congress on Evolutionary Computation 18--21 May 2009. Page(s):1493 - 1500. Google ScholarDigital Library
- Weihang Zhu, James Curry, Particle Swarm with Graphics Hardware Acceleration and Local Pattern Search on Bound Constrained Problems, IEEE Swarm Intelligence Symposium, April 2009, pp.120--127.Google Scholar
- NVIDIA CUDA Programming Guide1.1, 2007.Google Scholar
- P. J. Angeline, Using Selection to Improve Particle Swarm Optimization, in Proceedings of IJCNN '99, (Washington, USA), pp. 84--89, July 1999.Google Scholar
- M. Lovbjerg, T. K. Rasmussen, and T. Krink, Hybrid Particle Swarm Optimiser with Breeding and Subpopulations, in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), (San Francisco, USA), July 2001.Google Scholar
- F. van den Bergh, An Analysis of Particle Swarm Optimizers, PhD thesis, Department of Computer Science, University of Pretoria, South Africa, 2002.Google Scholar
- F. van den Bergh and A. Engelbrecht. A new locally convergent particle swarm optimizer, in Proceedings of IEEE Conference on System, Alan and Cybernetics.(Hammamet. Tunisia). Oct. 2002.Google ScholarCross Ref
- E.S. Peer. F.van Bergh. A.P. Engelbrecht. Using Neighbourhoods with the Guaranteed Convergence PSO, In Proceedings of the IEEE Swarm Intelligence Symposium, pages 235--242. IEEE Press, 2003Google ScholarCross Ref
- H.Higashi and H.Iba. Particle Swarm Optimization with Gaussian Mutation, In Proceedings of the IEEE Swarm Intelligence Symposium, pages 72--29. April, 2003Google ScholarCross Ref
- Tiew-On Ting, et al. A New Class of Operators to Accelerate Particle Swarm Optimization, In Proceedings of IEEE Congress on Evolutionary Computation, volum 4, pages 2406--2410, December 2003.Google Scholar
- Andrew Stacey, Mirjana Jancic, et al. Particle Swarm Optimization with Mutation, The Congress on Evolutionary Computation, Volume 2, pages 1425--1430, December 2003.Google ScholarCross Ref
- Susana C. Esquivel, Carlos A. Coello. On the Use of Particle Swarm Optimization with Multimodal Functions, The Congress on Evolutionary Computation, Volume 2, pages 1130 - 1136, December 2003.Google ScholarCross Ref
- Ning Li, Yuan-Qing Qin et al. Particle Swarm Optimization with mutation Operator, Proceedings of the Third International Conference on Machine Learning and Cybernetics, Volume 4, pages 2251- 2256, August 2004.Google Scholar
- P. N. Suganthan, N. Hansen, et al. Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization, IEEE Congress on Evolutionary Computation, 2005.Google Scholar
Index Terms
- Particle swarm optimization with triggered mutation and its implementation based on GPU
Recommendations
Time-Varying mutation in particle swarm optimization
ACIIDS'13: Proceedings of the 5th Asian conference on Intelligent Information and Database Systems - Volume Part IOne of significant improvement for particle swarm optimization (PSO) is through the implementation of metaheuristics hybridization that combines different metaheuristics paradigms. By using metaheuristics hybridization, the weaknesses of one algorithm ...
Enforced mutation to enhancing the capability of particle swarm optimization algorithms
ICSI'11: Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part IParticle Swarm Optimization (PSO), proposed by Professor Kennedy and Eberhart in 1995, attracts many attentions to solve for a lot of optimization problems nowadays. Due to its simplicity of setting-parameters and computational efficiency, it becomes ...
Particle Swarm Optimization with Adaptive Mutation
ICIE '09: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02Particle swarm optimization (PSO) has shown its good performance in many optimization problems. However, PSO could often easily fall into local minima because the particles could quickly converge to a position by the attraction of the best particles. ...
Comments