An adaptive staged PSO based on particles' search capabilities

  • Authors:

  • Kun Liu;Ying Tan;Xingui He

  • Affiliations:

  • Key laboratory of Machine Perception, Ministry of Education, Peking University, Beijing, China;Key laboratory of Machine Perception, Ministry of Education, Peking University, Beijing, China;Key laboratory of Machine Perception, Ministry of Education, Peking University, Beijing, China

  • Venue:
  • ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This study proposes an adaptive staged particle swarm optimization (ASPSO) algorithm based on analyses of particles' search capabilities First, the search processes of the standard PSO (SPSO) and the linear decreasing inertia weight PSO (LDWPSO) are analyzed based on our previous definition of exploitation Second, three stages of the search process in PSO are defined Each stage has its own search preference, which is represented by the exploitation capability of swarm Third, the mapping between inertia weight, learning factor (w-c) and the exploitation capability is given At last, the ASPSO is proposed By setting different values of w-c in three stages, one can make swarm search the space with particular strategy in each stage, and the particles can be directed to find the solution more effectively The experimental results show that the proposed ASPSO has better performance than SPSO and LDWPSO on most of test functions.