A new and improved version of particle swarm optimization algorithm with global–local best parameters

  • Authors:
  • M. Senthil Arumugam;M. V. C. Rao;Aarthi Chandramohan

  • Affiliations:
  • Multimedia University, Faculty of Engineering and Technology, Jalan Ayer Keroh Lama, 75450, Malacca, Malaysia;Multimedia University, Faculty of Engineering and Technology, Jalan Ayer Keroh Lama, 75450, Malacca, Malaysia;Multimedia University, Faculty of Information Science and Technology, Jalan Ayer Keroh Lama, 75450, Malacca, Malaysia

  • Venue:
  • Knowledge and Information Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a new and improved version of particle swarm optimization algorithm (PSO) combining the global best and local best model, termed GLBest-PSO. The GLBest-PSO incorporates global–local best inertia weight (GLBest IW) with global–local best acceleration coefficient (GLBest Ac). The velocity equation of the GLBest-PSO is also simplified. The ability of the GLBest-PSO is tested with a set of bench mark problems and the results are compared with those obtained through conventional PSO (cPSO), which uses time varying inertia weight (TVIW) and acceleration coefficient (TVAC). Fine tuning variants such as mutation, cross-over and RMS variants are also included with both cPSO and GLBest-PSO to improve the performance. The simulation results clearly elucidate the advantage of the fine tuning variants, which sharpen the convergence and tune to the best solution for both cPSO and GLBest-PSO. To compare and verify the validity and effectiveness of the GLBest-PSO, a number of statistical analyses are carried out. It is also observed that the convergence speed of GLBest-PSO is considerably higher than cPSO. All the results clearly demonstrate the superiority of the GLBest-PSO.