Title: Premature convergence of standard particle swarm optimisation algorithm based on Markov chain analysis

Authors: Gang Xu; Zhi-Hua Wu; Mei-Zhen Jiang

Addresses: Department of Mathematics, Nanchang University, Nanchang, China ' Department of Mathematics, Nanchang University, Nanchang, China ' Department of Mathematics, Nanchang University, Nanchang, China

Abstract: Particle Swarm Optimisation (PSO) is a population-based stochastic optimisation algorithm. The most important advantages of the PSO are that PSO is easy to implement and there are few parameters to adjust, but PSO is easy to get trapped in local optimum. In this paper, the premature convergence of standard PSO is investigated based on Markov chain. First, according to the difference model of standard PSO algorithm, the particle state sequence and swarm state sequence are defined and the one-step transition probability of state is introduced; it is shown that the particle state sequence and swarm state sequence are all Markov chains and their Markov properties are analysed. Second, for premature convergence of standard PSO, its analysis is given based on Markov chain. Last, it is proved that standard PSO is convergent to premature convergent state in probability.

Keywords: particle swarm optimisation; PSO; premature convergence; Markov chain; uniform population.

DOI: 10.1504/IJWMC.2015.074034

International Journal of Wireless and Mobile Computing, 2015 Vol.9 No.4, pp.377 - 382

Received: 07 May 2015
Accepted: 23 Jun 2015

Published online: 02 Jan 2016 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article