Particle swarm optimization with information share mechanism

  • Authors:
  • Zhi-hui Zhan;Jun Zhang;Rui-zhang Huang

  • Affiliations:
  • SUN Yat-sen University, Guangzhou, China;SUN Yat-sen University, Guangzhou, China;The Hong Kong polytechnic University, Hong Kong, Hong Kong

  • Venue:
  • Proceedings of the 11th Annual conference on Genetic and evolutionary computation
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an information share mechanism into particle swarm optimization (PSO) in order to use all the useful information of the swarm to prevent premature convergence. The particle in traditional PSO uses only the information from its personal best position and the neighborhood's best position. This mechanism is not with sufficient search information and therefore the algorithm is easy to be trapped into local optima. In the proposed information share PSO (ISPSO), all the particles post their best search information to a share device and any particle can read the information on the device and use the information provided by any other particle to help enhance its search ability. Therefore, the ISPSO can use the whole swarm's information to guide the flying direction. The ISPSO has been applied to optimize multimodal functions, and the experimental results demonstrate that the ISPSO can yield better performance when is compared with the traditional and some other improved PSOs.