Skip to search boxSkip to navigationSkip to main content

An n-state switching PSO algorithm for scalable optimization

  • Izaz Ur Rahman(corresponding author)
    ,
  • Muhammad Zakarya(corresponding author)
    ,
  • Mushtaq Raza
    ,
  • Rahim Khan
*Corresponding author for this work
  • Abdul Wali Khan University Mardan
    ,
  • University of Porto
Research Output:
Contribution to journal
Article
Research
Peer-review

Abstract

<p>Particle swarm optimization (PSO) is an optimization method that is most widely used to solve a number of problems in various fields such as engineering, economics and computer systems. However, due to its scalability and unsatisfying performance particularly for large-scale optimization problems; numerous PSO variants have been suggested so far, in the literature. This paper also proposes a new variant of the canonical PSO algorithm (‘N-state switching PSO—NS-SPSO’) that uses the evolutionary factor information to update particles velocities and, therefore, further enhance its performance. The evolutionary factor is derived by using the population distribution and the mean distance of each particle from the global best. The population distribution and the mean distance are determined through Euclidean distance. Moreover, algorithmic parameters such as inertia weight, and acceleration coefficients are assigned appropriate values at N stages (derived from exploration, exploitation, convergence and jumping out states) that improves the search efficiency and convergence speed. The proposed algorithm is applied to 12 widely used mathematical benchmark functions that demonstrate its best performance in terms of minimum evaluation error, fast convergence and low computational time. Besides these, seven high-dimensional functions and few other algorithms for large-scale optimization were considered to test the scalability of NS-SPSO algorithm. Our comparative results show that NS-SPSO performs well on low-dimensional problems and is promising for solving large-scale optimization problems. Furthermore, the proposed NS-PSO algorithm almost outperforms its closest rivals for various benchmarks.</p>

Research Output Information

Output type

Research Output:
Contribution to journal
Article
Research
Peer-review

Original language

English

Pages from-to (Number of pages)

Pages 11297-11314 (18 pages)

Journal (Volume, Issue Number)

Soft Computing (Volume 24, Issue 15)

Publication milestones

  • Published - 01/08/2020

Publication status

Published - 01/08/2020

ISSN

1432-7643

Publication IDs

  • Scopus: 85086596456

Publication metrics

Metrics

Scopus
citations
SciVal
FWCI
1.86

PlumX, opens in new tab

Citation count
27
Captures
9