The stop and go particle swarm: A swarm with a dynamically adapting population size

Kevin J. Binkley, Masafumi Hagiwara

Research output: Contribution to journalArticle

Abstract

In this study, we propose the stop and go particle swarm optimization (PSO) algorithm, a new method to dynamically adapt the PSO population size. Stop and go PSO (SG-PSO) takes advantage of the fact that in practical problems there is a limit to the required accuracy of the optimization result. In SG-PSO, particles are stopped when they have approximately reached the required accuracy. Stopped particles do not consume valuable function evaluations. Still, the information contained in the stopped particles' state is not lost, but rather as the swarm evolves, the particles may become active again, behaving as a memory for the swarm. In addition, as an extension to the SG-PSO algorithm we propose the mixed SG-PSO (MSG-PSO) algorithm. In the MSG-PSO algorithm each particle is given a required accuracy, and through the accuracy settings global search and local search can be balanced. Both SG-PSO and MSG-PSO algorithms are straightforward modifications to the standard PSO algorithm. The SG-PSO algorithm shows strong improvements over the standard PSO algorithm on multimodal benchmark functions from the PSO literature while approximately equivalent results are observed on unimodal benchmark functions. The MSG-PSO algorithm outperforms the standard PSO algorithm on both unimodal and multimodal benchmark functions.

Original languageEnglish
Pages (from-to)234-244
Number of pages11
JournalTransactions of the Japanese Society for Artificial Intelligence
Volume23
Issue number3
Publication statusPublished - 2008

Fingerprint

Particle swarm optimization (PSO)
Function evaluation

Keywords

  • Dynamic population
  • Evolutionary algorithm
  • Optimization
  • Particle swarm optimization

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

The stop and go particle swarm : A swarm with a dynamically adapting population size. / Binkley, Kevin J.; Hagiwara, Masafumi.

In: Transactions of the Japanese Society for Artificial Intelligence, Vol. 23, No. 3, 2008, p. 234-244.

Research output: Contribution to journalArticle

@article{a9ac17acb1784977bc3a7e1d7590db16,
title = "The stop and go particle swarm: A swarm with a dynamically adapting population size",
abstract = "In this study, we propose the stop and go particle swarm optimization (PSO) algorithm, a new method to dynamically adapt the PSO population size. Stop and go PSO (SG-PSO) takes advantage of the fact that in practical problems there is a limit to the required accuracy of the optimization result. In SG-PSO, particles are stopped when they have approximately reached the required accuracy. Stopped particles do not consume valuable function evaluations. Still, the information contained in the stopped particles' state is not lost, but rather as the swarm evolves, the particles may become active again, behaving as a memory for the swarm. In addition, as an extension to the SG-PSO algorithm we propose the mixed SG-PSO (MSG-PSO) algorithm. In the MSG-PSO algorithm each particle is given a required accuracy, and through the accuracy settings global search and local search can be balanced. Both SG-PSO and MSG-PSO algorithms are straightforward modifications to the standard PSO algorithm. The SG-PSO algorithm shows strong improvements over the standard PSO algorithm on multimodal benchmark functions from the PSO literature while approximately equivalent results are observed on unimodal benchmark functions. The MSG-PSO algorithm outperforms the standard PSO algorithm on both unimodal and multimodal benchmark functions.",
keywords = "Dynamic population, Evolutionary algorithm, Optimization, Particle swarm optimization",
author = "Binkley, {Kevin J.} and Masafumi Hagiwara",
year = "2008",
language = "English",
volume = "23",
pages = "234--244",
journal = "Transactions of the Japanese Society for Artificial Intelligence",
issn = "1346-0714",
publisher = "Japanese Society for Artificial Intelligence",
number = "3",

}

TY - JOUR

T1 - The stop and go particle swarm

T2 - A swarm with a dynamically adapting population size

AU - Binkley, Kevin J.

AU - Hagiwara, Masafumi

PY - 2008

Y1 - 2008

N2 - In this study, we propose the stop and go particle swarm optimization (PSO) algorithm, a new method to dynamically adapt the PSO population size. Stop and go PSO (SG-PSO) takes advantage of the fact that in practical problems there is a limit to the required accuracy of the optimization result. In SG-PSO, particles are stopped when they have approximately reached the required accuracy. Stopped particles do not consume valuable function evaluations. Still, the information contained in the stopped particles' state is not lost, but rather as the swarm evolves, the particles may become active again, behaving as a memory for the swarm. In addition, as an extension to the SG-PSO algorithm we propose the mixed SG-PSO (MSG-PSO) algorithm. In the MSG-PSO algorithm each particle is given a required accuracy, and through the accuracy settings global search and local search can be balanced. Both SG-PSO and MSG-PSO algorithms are straightforward modifications to the standard PSO algorithm. The SG-PSO algorithm shows strong improvements over the standard PSO algorithm on multimodal benchmark functions from the PSO literature while approximately equivalent results are observed on unimodal benchmark functions. The MSG-PSO algorithm outperforms the standard PSO algorithm on both unimodal and multimodal benchmark functions.

AB - In this study, we propose the stop and go particle swarm optimization (PSO) algorithm, a new method to dynamically adapt the PSO population size. Stop and go PSO (SG-PSO) takes advantage of the fact that in practical problems there is a limit to the required accuracy of the optimization result. In SG-PSO, particles are stopped when they have approximately reached the required accuracy. Stopped particles do not consume valuable function evaluations. Still, the information contained in the stopped particles' state is not lost, but rather as the swarm evolves, the particles may become active again, behaving as a memory for the swarm. In addition, as an extension to the SG-PSO algorithm we propose the mixed SG-PSO (MSG-PSO) algorithm. In the MSG-PSO algorithm each particle is given a required accuracy, and through the accuracy settings global search and local search can be balanced. Both SG-PSO and MSG-PSO algorithms are straightforward modifications to the standard PSO algorithm. The SG-PSO algorithm shows strong improvements over the standard PSO algorithm on multimodal benchmark functions from the PSO literature while approximately equivalent results are observed on unimodal benchmark functions. The MSG-PSO algorithm outperforms the standard PSO algorithm on both unimodal and multimodal benchmark functions.

KW - Dynamic population

KW - Evolutionary algorithm

KW - Optimization

KW - Particle swarm optimization

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

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

M3 - Article

AN - SCOPUS:42949115422

VL - 23

SP - 234

EP - 244

JO - Transactions of the Japanese Society for Artificial Intelligence

JF - Transactions of the Japanese Society for Artificial Intelligence

SN - 1346-0714

IS - 3

ER -