Adaptive particle swarm optimization

Zhi- Hui Zhan, Jun Zhang, Yun Li, Henry Shu-Hung Chung

Research output: Contribution to journalArticle

1130 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)1362-1381
Number of pages20
JournalIEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Volume39
Issue number6
DOIs
Publication statusPublished - 14 Apr 2009

Fingerprint

Particle swarm optimization (PSO)
Population distribution
State estimation

Keywords

  • adaptive particle swarm optimization (APSO)
  • convergence
  • evolutionary computation
  • global optimization
  • particle swarm optimization
  • Particle swarm optimization (PSO)
  • state estimation

Cite this

Zhan, Zhi- Hui ; Zhang, Jun ; Li, Yun ; Chung, Henry Shu-Hung. / Adaptive particle swarm optimization. In: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics. 2009 ; Vol. 39, No. 6. pp. 1362-1381.
@article{7b06a510a9c141af868a871b1174047f,
title = "Adaptive particle swarm optimization",
abstract = "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.",
keywords = "adaptive particle swarm optimization (APSO), convergence, evolutionary computation, global optimization, particle swarm optimization, Particle swarm optimization (PSO), state estimation",
author = "Zhan, {Zhi- Hui} and Jun Zhang and Yun Li and Chung, {Henry Shu-Hung}",
year = "2009",
month = "4",
day = "14",
doi = "10.1109/TSMCB.2009.2015956",
language = "English",
volume = "39",
pages = "1362--1381",
journal = "IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics",
issn = "1083-4419",
number = "6",

}

Adaptive particle swarm optimization. / Zhan, Zhi- Hui; Zhang, Jun; Li, Yun; Chung, Henry Shu-Hung.

In: IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, Vol. 39, No. 6, 14.04.2009, p. 1362-1381.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Adaptive particle swarm optimization

AU - Zhan, Zhi- Hui

AU - Zhang, Jun

AU - Li, Yun

AU - Chung, Henry Shu-Hung

PY - 2009/4/14

Y1 - 2009/4/14

N2 - 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.

AB - 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.

KW - adaptive particle swarm optimization (APSO)

KW - convergence

KW - evolutionary computation

KW - global optimization

KW - particle swarm optimization

KW - Particle swarm optimization (PSO)

KW - state estimation

UR - http://www.scopus.com/inward/record.url?scp=70349626031&partnerID=8YFLogxK

U2 - 10.1109/TSMCB.2009.2015956

DO - 10.1109/TSMCB.2009.2015956

M3 - Article

VL - 39

SP - 1362

EP - 1381

JO - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

JF - IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

SN - 1083-4419

IS - 6

ER -