Location of Repository

Opposition-based Particle Swarm Algorithm with Cauchy Mutation

By Hui Wang and Changhe Li

Abstract

Abstract — Particle Swarm Optimization (PSO) has shown its fast search speed in many complicated optimization and search problems. However, PSO could often easily fall into local optima because the particles could quickly get closer to the best particle. At such situations, the best particle could hardly be improved. This paper proposes a new hybrid PSO (HPSO) to solve this problem by adding a Cauchy mutation on the best particle so that the mutated best particle could lead all the rest of particles to the better positions. Experimental results on many well-known benchmark optimization problems have shown that HPSO could successfully deal with those difficult multimodal functions while maintaining fast search speed on those simple unimodal functions in the function optimization. Particle Swarm Optimization (PSO) was firstly introduce

Year: 2007
OAI identifier: oai:CiteSeerX.psu:10.1.1.183.4623
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.le.ac.uk/people/... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.