• DOI:10.1109/TSMCB.2009.2015956
• Corpus ID: 11191625

Adaptive Particle Swarm Optimization

@article{Zhan2009AdaptivePS,
  title={Adaptive Particle Swarm Optimization},
  author={Zhi-hui Zhan and Jun Zhang and Yun Li and Henry Shu-hung Chung},
  journal={IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)},
  year={2009},
  volume={39},
  pages={1362-1381}
}

• Zhi-hui Zhan, Jun Zhang, +1 author H. Chung
• Published 1 December 2009
• Computer Science
• IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)

An adaptive particle swarm optimization (APSO) that features better search efficiency than classical particle swarm optimization (PSO) is presented. More importantly, it can perform a global search over the entire search space with faster convergence speed. The APSO consists of two main steps. First, by evaluating the population distribution and particle fitness, a real-time evolutionary state estimation procedure is performed to identify one of the following four defined evolutionary states, including exploration, exploitation, convergence, and jumping out in each generation. It enables the automatic control of inertia weight, acceleration coefficients, and other algorithmic parameters at run time to improve the search efficiency and convergence speed. Then, an elitist learning strategy is performed when the evolutionary state is classified as convergence state. The strategy will act on the globally best particle to jump out of the likely local optima. The APSO has comprehensively been evaluated on 12 unimodal and multimodal benchmark functions. The effects of parameter adaptation and elitist learning will be studied. Results show that APSO substantially enhances the performance of the PSO paradigm in terms of convergence speed, global optimality, solution accuracy, and algorithm reliability. As APSO introduces two new parameters to the PSO paradigm only, it does not introduce an additional design or implementation complexity.