An Improved Particle Swarm Optimization with Mutation Based on Similarity

Authors:
Jianhua Liu;Xiaoping Fan;Zhihua Qu
Affiliations:
Central South University, China/ Fujian Normal University, China;Central South University, China;Central South University, China/ Univ. of Central Florida, USA
Venue:
ICNC '07 Proceedings of the Third International Conference on Natural Computation - Volume 04
Year:
2007

Citing 0
Cited 5

A genetic algorithm that adaptively mutates and never revisits

IEEE Transactions on Evolutionary Computation
Continuous non-revisiting genetic algorithm

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Development of immunized PSO algorithm and its application to Hammerstein model identification

CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Improved identification of Hammerstein plants using new CPSO and IPSO algorithms

Expert Systems with Applications: An International Journal
Simulation optimization using particle swarm optimization algorithm with application to assembly line design

Applied Soft Computing

Quantified Score

Hi-index	0.02

Visualization

Abstract

Particle swarm optimization (PSO) is a new population-based intelligence algorithm and exhibits good performance on optimization. However, during the running of the algorithm, the particles become more and more similar, and cluster into the best particle in the swarm, which make the swarm premature convergence around the local solution. In this paper, a new conception, collectivity, is proposed which is based on similarity between the particle and the current global best particle in the swarm. And the collectivity was used to randomly mutate the position of the particles, which make swarm keep diversity in the search space. Experiments on benchmark functions show that the new algorithm outperforms the basic PSO and some other improved PSO.