A cooperative particle swarm optimizer with stochastic movements for computationally expensive numerical optimization problems

Thi Thuy Ngo, Ali Sadollah, Joong Hoon Kim

Research output: Contribution to journalArticle

26 Citations (Scopus)

Abstract

Nature is the rich principal source for developing optimization algorithms. Metaheuristic algorithms can be classified with the emphasis on the source of inspiration into several categories such as biology, physics, and chemistry. The particle swarm optimization (PSO) is one of the most well-known bio-inspired optimization algorithms which mimics movement behavior of animal flocks especially bird and fish flocking. In standard PSO, velocity of each particle is influenced by the best individual and its best personal experience. This approach could make particles trap into the local optimums and miss opportunities of jumping to far better optimums than the currents and sometimes causes fast premature convergence. To overcome this issue, a new movement concept, so called extraordinariness particle swarm optimizer (EPSO) is proposed in this paper. The main contribution of this study is proposing extraordinary motion for particles in the PSO. Indeed, unlike predefined movement used in the PSO, particles in the EPSO can move toward a target which can be global best, local bests, or even the worst individual. The proposed improved PSO outperforms than the standard PSO and its variants for benchmarks such as CEC 2015 benchmarks. In addition, several constrained and engineering design problems have been tackled using the improved PSO and the optimization results have been compared with the standard PSO, variants of PSO, and other optimizers.

Original languageEnglish
Pages (from-to)68-82
Number of pages15
JournalJournal of Computational Science
Volume13
DOIs
Publication statusPublished - 2016 Mar 1

Fingerprint

Particle Swarm Optimizer
Numerical Optimization
Particle swarm optimization (PSO)
Particle Swarm Optimization
Optimization Problem
Optimization Algorithm
Benchmark
Movement
Flocking
Flock
Premature Convergence
Birds
Engineering Design
Fish
Trap
Metaheuristics
Chemistry
Biology
Animals
Physics

Keywords

  • Constrained optimization
  • Extraordinary particle swarm optimization
  • Global optimization
  • Metaheuristics
  • Particle swarm optimization

ASJC Scopus subject areas

  • Computer Science(all)
  • Modelling and Simulation
  • Theoretical Computer Science

Cite this

A cooperative particle swarm optimizer with stochastic movements for computationally expensive numerical optimization problems. / Ngo, Thi Thuy; Sadollah, Ali; Kim, Joong Hoon.

In: Journal of Computational Science, Vol. 13, 01.03.2016, p. 68-82.

Research output: Contribution to journalArticle

@article{85e1f3a3cf0c47f9829c0c2c917e7c7e,
title = "A cooperative particle swarm optimizer with stochastic movements for computationally expensive numerical optimization problems",
abstract = "Nature is the rich principal source for developing optimization algorithms. Metaheuristic algorithms can be classified with the emphasis on the source of inspiration into several categories such as biology, physics, and chemistry. The particle swarm optimization (PSO) is one of the most well-known bio-inspired optimization algorithms which mimics movement behavior of animal flocks especially bird and fish flocking. In standard PSO, velocity of each particle is influenced by the best individual and its best personal experience. This approach could make particles trap into the local optimums and miss opportunities of jumping to far better optimums than the currents and sometimes causes fast premature convergence. To overcome this issue, a new movement concept, so called extraordinariness particle swarm optimizer (EPSO) is proposed in this paper. The main contribution of this study is proposing extraordinary motion for particles in the PSO. Indeed, unlike predefined movement used in the PSO, particles in the EPSO can move toward a target which can be global best, local bests, or even the worst individual. The proposed improved PSO outperforms than the standard PSO and its variants for benchmarks such as CEC 2015 benchmarks. In addition, several constrained and engineering design problems have been tackled using the improved PSO and the optimization results have been compared with the standard PSO, variants of PSO, and other optimizers.",
keywords = "Constrained optimization, Extraordinary particle swarm optimization, Global optimization, Metaheuristics, Particle swarm optimization",
author = "Ngo, {Thi Thuy} and Ali Sadollah and Kim, {Joong Hoon}",
year = "2016",
month = "3",
day = "1",
doi = "10.1016/j.jocs.2016.01.004",
language = "English",
volume = "13",
pages = "68--82",
journal = "Journal of Computational Science",
issn = "1877-7503",
publisher = "Elsevier",

}

TY - JOUR

T1 - A cooperative particle swarm optimizer with stochastic movements for computationally expensive numerical optimization problems

AU - Ngo, Thi Thuy

AU - Sadollah, Ali

AU - Kim, Joong Hoon

PY - 2016/3/1

Y1 - 2016/3/1

N2 - Nature is the rich principal source for developing optimization algorithms. Metaheuristic algorithms can be classified with the emphasis on the source of inspiration into several categories such as biology, physics, and chemistry. The particle swarm optimization (PSO) is one of the most well-known bio-inspired optimization algorithms which mimics movement behavior of animal flocks especially bird and fish flocking. In standard PSO, velocity of each particle is influenced by the best individual and its best personal experience. This approach could make particles trap into the local optimums and miss opportunities of jumping to far better optimums than the currents and sometimes causes fast premature convergence. To overcome this issue, a new movement concept, so called extraordinariness particle swarm optimizer (EPSO) is proposed in this paper. The main contribution of this study is proposing extraordinary motion for particles in the PSO. Indeed, unlike predefined movement used in the PSO, particles in the EPSO can move toward a target which can be global best, local bests, or even the worst individual. The proposed improved PSO outperforms than the standard PSO and its variants for benchmarks such as CEC 2015 benchmarks. In addition, several constrained and engineering design problems have been tackled using the improved PSO and the optimization results have been compared with the standard PSO, variants of PSO, and other optimizers.

AB - Nature is the rich principal source for developing optimization algorithms. Metaheuristic algorithms can be classified with the emphasis on the source of inspiration into several categories such as biology, physics, and chemistry. The particle swarm optimization (PSO) is one of the most well-known bio-inspired optimization algorithms which mimics movement behavior of animal flocks especially bird and fish flocking. In standard PSO, velocity of each particle is influenced by the best individual and its best personal experience. This approach could make particles trap into the local optimums and miss opportunities of jumping to far better optimums than the currents and sometimes causes fast premature convergence. To overcome this issue, a new movement concept, so called extraordinariness particle swarm optimizer (EPSO) is proposed in this paper. The main contribution of this study is proposing extraordinary motion for particles in the PSO. Indeed, unlike predefined movement used in the PSO, particles in the EPSO can move toward a target which can be global best, local bests, or even the worst individual. The proposed improved PSO outperforms than the standard PSO and its variants for benchmarks such as CEC 2015 benchmarks. In addition, several constrained and engineering design problems have been tackled using the improved PSO and the optimization results have been compared with the standard PSO, variants of PSO, and other optimizers.

KW - Constrained optimization

KW - Extraordinary particle swarm optimization

KW - Global optimization

KW - Metaheuristics

KW - Particle swarm optimization

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

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

U2 - 10.1016/j.jocs.2016.01.004

DO - 10.1016/j.jocs.2016.01.004

M3 - Article

AN - SCOPUS:84956925661

VL - 13

SP - 68

EP - 82

JO - Journal of Computational Science

JF - Journal of Computational Science

SN - 1877-7503

ER -