Particle swarm optimization with controlled mutation

This paper presents a new Particle Swarm Optimization (PSO) technique which uses mutation. This method is based on PSO, with mutation appended to it. The most important point in this paper is that we make use of the information provided to gbest by the mutation of just one dimension, because we consider that gbest is the best possible information to update after mutation. In this paper, we adapt this method into Linearly Decreasing Inertia Weight Method (LDIWM), and validate it through several benchmark problems. Copyright © 2007 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

[1]  Chen Haiyan,et al.  An Improved Particle Swarm Optimization Algorithm for Multistage and Coordinated Planning of Transmission Systems , 2005, 2005 IEEE/PES Transmission & Distribution Conference & Exposition: Asia and Pacific.

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

[3]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[4]  Hitoshi Iba,et al.  Particle swarm optimization with Gaussian mutation , 2003, Proceedings of the 2003 IEEE Swarm Intelligence Symposium. SIS'03 (Cat. No.03EX706).