Boid particle swarm optimisation. (25th February 2010)

• Record Type: Journal Article
• Authors: Cui, Zhihua; Shi, Zhongzhi
• Is Part Of: International journal of innovative computing and applications. Volume 2:Number 2(2009)
• Page Start: 77
• Page End: 85
• Publication Date: 2010-02-25
• Subjects: boid particle swarm optimisation -- BPSO -- separation rules -- alignment rules -- cohesion rules; Evolutionary computation -- Periodicals; Neural networks (Computer science) -- Periodicals; Genetic programming (Computer science) -- Periodicals; Biologically-inspired computing -- Periodicals; Swarm intelligence -- Periodicals; Quantum computers -- Periodicals; 006.3
• Languages: English
• ISSNs: 1751-648X

Abstract

Particle swarm optimisation (PSO) is a novel population-based stochastic optimisation algorithm inspired by the Reynolds' boid model. The original biological background of boid obeys three basic simple steering rules: separation, alignment and cohesion. However, to promote a simple update equation, none of these rules of boid model is employed by PSO methodology. Due to the weakness of biological background of PSO, in this paper, a new variant of PSO, boid particle swarm optimisation (BPSO), is designed in which cohesion rule and alignment rule are both employed to improve the performance. In BPSO, each particle has two motions: divergent motion and convergent motion. For divergent motion, each particle adjusts its moving direction according to the alignment direction and the cohesion direction, as well as in convergent motion, the original update equation of the standard version of PSO is used. To make a motion transition, a threshold is introduced to make the divergent motion is employed in the first period, whereas the convergent motion is used in the final stage. To testify the efficiency, several unconstrained benchmarks are used to compare. Simulation results show the proposed variant is more effective and efficient than other two variants of PSO when solving multi-modal high-dimensional numerical problems.