A fuzzy adaptive turbulent particle swarm optimisation. (26th April 2007)

• Record Type: Journal Article
• Authors: Liu, Hongbo; Abraham, Ajith; Zhang, Weishi
• Is Part Of: International journal of innovative computing and applications. Volume 1:Number 1(2007)
• Page Start: 39
• Page End: 47
• Publication Date: 2007-04-26
• Subjects: swarm based computing -- particle swarm optimisation -- fuzzy PSO -- adaptive PSO -- turbulent PSO -- fuzzy control -- genetic algorithms -- GA -- simulated annealing -- SA -- premature convergence -- turbulence -- fitness stagnation -- particle velocity -- fuzzy logic; 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) algorithm is a stochastic search technique, which has exhibited good performance across a wide range of applications. However, very often for multimodal problems involving high dimensions, the algorithm tends to suffer from premature convergence. Analysis of the behaviour of the particle swarm model reveals that such premature convergence is mainly due to the decrease of velocity of particles in the search space that leads to a total implosion and ultimately fitness stagnation of the swarm. This paper introduces Turbulence in the Particle Swarm Optimisation (TPSO) algorithm to overcome the problem of stagnation. The algorithm uses a minimum velocity threshold to control the velocity of particles. The parameter, minimum velocity threshold of the particles is tuned adaptively by a fuzzy logic controller embedded in the TPSO algorithm, which is further called as Fuzzy Adaptive TPSO (FATPSO). We evaluated the performance of FATPSO and compared it with the Standard PSO (SPSO), Genetic Algorithm (GA) and Simulated Annealing (SA). The comparison was performed on a suite of 10 widely used benchmark problems for 30 and 100 dimensions. Empirical results illustrate that the FATPSO could prevent premature convergence very effectively and it clearly outperforms SPSO and GA.