Balancing exploitation and exploration in particle swarm optimization: Velocity-based reinitialization

Kevin J. Binkley, Masafumi Hagiwara

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In particle swarm optimization (PSO) algorithms there is a delicate balance to maintain between exploitation (local search) and exploration (global search). When facing multimodal functions, the standard PSO algorithm often converges to a local minimum quickly, missing better opportunities. Methods such as non-global best neighborhoods increase exploration, but at the expense of slowing the convergence of the whole PSO algorithm. In this paper, we propose a new method to extend PSO, velocity-based reinitialization (VBR). VBR is both simple to implement and effective at enhancing many different PSO algorithms from the literature. In VBR-PSO, the velocities of the particles are monitored throughout the evolution, and when the median velocity of the swarm particles has dropped below a threshold, the whole swarm is reinitialized. Through VBR, the problem of premature convergence is alleviated; VBR-PSO focuses on one minimum at a time. In our experiments, we apply VBR to the global-best, local best, and von Neumann neighborhood PSO algorithms. Results are presented using the standard benchmark functions from the PSO literature. VBR enhanced PSO yields improved results on the multimodal benchmark functions for all PSO algorithms investigated in this study.

Original languageEnglish
Pages (from-to)27-35
Number of pages9
JournalTransactions of the Japanese Society for Artificial Intelligence
Volume23
Issue number1
Publication statusPublished - 2008

Fingerprint

Particle swarm optimization (PSO)

Keywords

  • Optimization
  • Particle swarm optimization
  • Velocity-based reinitialization

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

@article{662c2d6c2cd648c8a4f6ddba4112f55a,
title = "Balancing exploitation and exploration in particle swarm optimization: Velocity-based reinitialization",
abstract = "In particle swarm optimization (PSO) algorithms there is a delicate balance to maintain between exploitation (local search) and exploration (global search). When facing multimodal functions, the standard PSO algorithm often converges to a local minimum quickly, missing better opportunities. Methods such as non-global best neighborhoods increase exploration, but at the expense of slowing the convergence of the whole PSO algorithm. In this paper, we propose a new method to extend PSO, velocity-based reinitialization (VBR). VBR is both simple to implement and effective at enhancing many different PSO algorithms from the literature. In VBR-PSO, the velocities of the particles are monitored throughout the evolution, and when the median velocity of the swarm particles has dropped below a threshold, the whole swarm is reinitialized. Through VBR, the problem of premature convergence is alleviated; VBR-PSO focuses on one minimum at a time. In our experiments, we apply VBR to the global-best, local best, and von Neumann neighborhood PSO algorithms. Results are presented using the standard benchmark functions from the PSO literature. VBR enhanced PSO yields improved results on the multimodal benchmark functions for all PSO algorithms investigated in this study.",
keywords = "Optimization, Particle swarm optimization, Velocity-based reinitialization",
author = "Binkley, {Kevin J.} and Masafumi Hagiwara",
year = "2008",
language = "English",
volume = "23",
pages = "27--35",
journal = "Transactions of the Japanese Society for Artificial Intelligence",
issn = "1346-0714",
publisher = "Japanese Society for Artificial Intelligence",
number = "1",

}

TY - JOUR

T1 - Balancing exploitation and exploration in particle swarm optimization

T2 - Velocity-based reinitialization

AU - Binkley, Kevin J.

AU - Hagiwara, Masafumi

PY - 2008

Y1 - 2008

N2 - In particle swarm optimization (PSO) algorithms there is a delicate balance to maintain between exploitation (local search) and exploration (global search). When facing multimodal functions, the standard PSO algorithm often converges to a local minimum quickly, missing better opportunities. Methods such as non-global best neighborhoods increase exploration, but at the expense of slowing the convergence of the whole PSO algorithm. In this paper, we propose a new method to extend PSO, velocity-based reinitialization (VBR). VBR is both simple to implement and effective at enhancing many different PSO algorithms from the literature. In VBR-PSO, the velocities of the particles are monitored throughout the evolution, and when the median velocity of the swarm particles has dropped below a threshold, the whole swarm is reinitialized. Through VBR, the problem of premature convergence is alleviated; VBR-PSO focuses on one minimum at a time. In our experiments, we apply VBR to the global-best, local best, and von Neumann neighborhood PSO algorithms. Results are presented using the standard benchmark functions from the PSO literature. VBR enhanced PSO yields improved results on the multimodal benchmark functions for all PSO algorithms investigated in this study.

AB - In particle swarm optimization (PSO) algorithms there is a delicate balance to maintain between exploitation (local search) and exploration (global search). When facing multimodal functions, the standard PSO algorithm often converges to a local minimum quickly, missing better opportunities. Methods such as non-global best neighborhoods increase exploration, but at the expense of slowing the convergence of the whole PSO algorithm. In this paper, we propose a new method to extend PSO, velocity-based reinitialization (VBR). VBR is both simple to implement and effective at enhancing many different PSO algorithms from the literature. In VBR-PSO, the velocities of the particles are monitored throughout the evolution, and when the median velocity of the swarm particles has dropped below a threshold, the whole swarm is reinitialized. Through VBR, the problem of premature convergence is alleviated; VBR-PSO focuses on one minimum at a time. In our experiments, we apply VBR to the global-best, local best, and von Neumann neighborhood PSO algorithms. Results are presented using the standard benchmark functions from the PSO literature. VBR enhanced PSO yields improved results on the multimodal benchmark functions for all PSO algorithms investigated in this study.

KW - Optimization

KW - Particle swarm optimization

KW - Velocity-based reinitialization

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

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

M3 - Article

AN - SCOPUS:41849126716

VL - 23

SP - 27

EP - 35

JO - Transactions of the Japanese Society for Artificial Intelligence

JF - Transactions of the Japanese Society for Artificial Intelligence

SN - 1346-0714

IS - 1

ER -