Adaptive particle swarm optimization algorithm

Tao Cai*, Feng Pan, Jie Chen

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

7 Citations (Scopus)

Abstract

The particle swarm optimization (PSO) has exhibited good performance on optimization. However, the parameters, which greatly influence the algorithm stability and performance, are selected depending on experience of designer. The selection of parameters needs to consider both the convergence and avoiding premature convergence. Adaptive PSO (APSO) was presented, based on the stability criterion of the PSO as a time-varying discrete system. Simulation results of some well-known problems show that APSO not only ensure the stability of algorithm, but also avoid premature convergence effectively and clearly outperform the standard PSO.

Original languageEnglish
Pages2245-2247
Number of pages3
Publication statusPublished - 2004
EventWCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings - Hangzhou, China
Duration: 15 Jun 200419 Jun 2004

Conference

ConferenceWCICA 2004 - Fifth World Congress on Intelligent Control and Automation, Conference Proceedings
Country/TerritoryChina
CityHangzhou
Period15/06/0419/06/04

Keywords

  • Adaptive particle swarm optimization (APSO)
  • Premature convergence
  • Stability

Fingerprint

Dive into the research topics of 'Adaptive particle swarm optimization algorithm'. Together they form a unique fingerprint.

Cite this