A cautious PSO with conditional random

doi:10.1016/j.eswa.2014.12.046

2015-05-01

PRE

Chien‐Lung Chan

Chia‐Li Chen *

DOI：10.1016/j.eswa.2014.12.046

原文链接

原文求助

摘要

En 中文

Particle swarm optimization (PSO) simulates social behavior, such as birds flocking or fish schooling. It is an emerging population-based meta-heuristic and a population-based evolutionary algorithm that is used to achieve precise objectives in a multidimensional space. A population (called a swarm) is made up of individuals (called particles) that are updated by iteration. Each particle uses its own best previous experience (pBest) and the best experience (gBest) of all other members to correctly search for a direction. The two important factors are pBest and gBest. A PSO algorithm has four advantages: fewer parameters must be adjusted, it is easy to understand, easy to implement and it is computationally efficient. But it also easily becomes trapped in local optima and the convergence rate is significantly decreased in the latter period of evolutionary processing. The algorithm can easily fall into a local optimum early, because a random value is used to influence the weights of pBest and gBest. This study proposes that, given a prescribed probability that is adjusted randomly, the algorithm is prevented from falling into the local optimum early and the convergence speed and search performance are both improved. This method is compared with a standard PSO algorithm that uses eight standard testing benchmark functions, thirty times. The results show that convergence to an accurate solution is faster for 6 functions (the Sphere, the Rosenbrock, the Rastrigin, the Ackley, the Griewank and the Salomon function). (C) 2015 Elsevier Ltd. All rights reserved.

Keyword:

Particle swarm optimization

Conditional random