Bare Bones Particle Swarm Optimization with Gaussian or Cauchy jumps
Authors:
- 1 May 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 3285-3291
Abstract
Bare Bones Particle Swarm Optimization (BBPSO) is a powerful algorithm, which has shown potential to solving multimodal optimization problems. Unfortunately, BBPSO may also get stuck into local optima when optimizing functions with many local optima in high dimensional search space. In previous attempts an approach was developed which consists of a jump strategy combined with PSO in order to escape from local optima and promising results have been obtained. In this paper, we combine BBPSO with a jump strategy when no fitness improvement is observed. The jump strategy is implemented based on the Gaussian or the Cauchy probability distribution. The algorithm was tested on a suite of well-known benchmark multimodal functions and the results were compared with those obtained by the standard BBPSO algorithm and with BBPSO with re-initialization. Simulation results show that the BBPSO with the jump strategy performs well in all functions investigated. We also notice that the improved performance is due to a successful number of Gaussian or Cauchy jumps.Keywords
This publication has 12 references indexed in Scilit:
- Defining a Standard for Particle Swarm Optimization2007
- Coevolutionary Particle Swarm Optimization Using Gaussian Distribution for Solving Constrained Optimization ProblemsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 2006
- Particle swarm optimization with mutation2004
- Visualizing particle swarm optimization - Gaussian particle swarm optimization2004
- Particle swarm optimization with Gaussian mutation2004
- Bare bones particle swarms2004
- Evolutionary Programming Using Mutations Based on the LÉvy Probability DistributionIEEE Transactions on Evolutionary Computation, 2004
- The particle swarm - explosion, stability, and convergence in a multidimensional complex spaceIEEE Transactions on Evolutionary Computation, 2002
- Self-adaptive mutations may lead to premature convergenceIEEE Transactions on Evolutionary Computation, 2001
- Evolutionary programming made fasterIEEE Transactions on Evolutionary Computation, 1999