.png){kind=icon}
.png){kind=icon}
Return
An n-state switching PSO algorithm for scalable optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-020-05069-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 atNstages (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.
Keywords:
Particle swarm optimization
Evolutionary factor
Large-scale optimization
scalability
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.5
Papers:
1.0W
Citations:
2.1W