Grey particle swarm optimization

  • Authors:
  • Min-Shyang Leu;Ming-Feng Yeh

  • Affiliations:
  • Department of Electrical Engineering, Lunghwa University of Science and Technology, Taoyuan, Taiwan;Department of Electrical Engineering, Lunghwa University of Science and Technology, Taoyuan, Taiwan

  • Venue:
  • Applied Soft Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

With the help of grey relational analysis, this study attempts to propose two grey-based parameter automation strategies for particle swarm optimization (PSO). One is for the inertia weight and the other is for the acceleration coefficients. By the proposed approaches, each particle has its own inertia weight and acceleration coefficients whose values are dependent upon the corresponding grey relational grade. Since the relational grade of a particle is varying over the iterations, those parameters are also time-varying. Even if in the same iteration, those parameters may differ for different particles. In addition, owing to grey relational analysis involving the information of population distribution, such parameter automation strategies make an attempt on the grey PSO to perform a global search over the search space with faster convergence speed. The proposed grey PSO is applied to solve the optimization problems of 12 unimodal and multimodal benchmark functions for illustration. Simulation results are compared with the adaptive PSO (APSO) and two well-known PSO variants, PSO with linearly varying inertia weight (PSO-LVIW) and PSO with time-varying acceleration coefficients (HPSO-TVAC), to demonstrate the search performance of the grey PSO.