Title
A fast particle swarm optimization algorithm with cauchy mutation and natural selection strategy
Abstract
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group's previous best to optimize problems. One problem exists in PSO is its tendency of trapping into local optima. In this paper, a fast particle swarm optimization (FPSO) algorithm is proposed by combining PSO and the Cauchy mutation and an evolutionary selection strategy. The idea is to introduce the Cauchy mutation into PSO in the hope of preventing PSO from trapping into a local optimum through long jumps made by the Cauchy mutation. FPSO has been compared with another improved PSO called AMPSO [12] on a set of benchmark functions. The results show that FPSO is much faster than AMPSO on all the test functions.
Year
DOI
Venue
2007
10.1007/978-3-540-74581-5_37
ISICA
Keywords
Field
DocType
natural selection strategy,own previous best solution,cauchy mutation,local optimum,improved pso,novel evolutionary algorithm,benchmark function,fast particle swarm optimization,long jump,standard particle swarm optimization,evolutionary selection strategy,natural selection,optimization problem,swarm intelligence,evolutionary algorithm
Particle swarm optimization,Mathematical optimization,Evolutionary algorithm,Local optimum,Swarm intelligence,Natural selection,Algorithm,Multi-swarm optimization,Imperialist competitive algorithm,Mathematics,Metaheuristic
Conference
Volume
ISSN
ISBN
4683
0302-9743
3-540-74580-7
Citations 
PageRank 
References 
22
1.18
9
Authors
5
Name
Order
Citations
PageRank
Changhe Li1104443.37
Yong Liu22526265.08
Aimin Zhou3160760.66
Lishan Kang477591.11
Hui Wang538627.33