A Fast Particle Swarm Optimization Algorithm with Cauchy Mutation and Natural Selection Strategy

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.

• Type: Conference
• Year: 2007
• Where: ISICA
• Authors: Changhe Li, Yong Liu, Aimin Zhou, Lishan Kang, Hui Wang
• Keywords: Cauchy Mutation, Evolutionary Selection Strategy, ISICA 2007, Particle Swarm Optimization