Title

An Improved Particle Swarm Optimization With Mutation Based On Similarity

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. © 2007 IEEE.

Publication Date

12-1-2007

Publication Title

Proceedings - Third International Conference on Natural Computation, ICNC 2007

Volume

4

Number of Pages

824-828

Document Type

Article; Proceedings Paper

Personal Identifier

scopus

DOI Link

https://doi.org/10.1109/ICNC.2007.223

Socpus ID

38049018005 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/38049018005

This document is currently not available here.

Share

COinS