Abstract—Particle swarm optimization (PSO) is the most important and popular algorithm to solving the engineering optimization problem due to its simple updating formulas and excellent searching capacity. This algorithm is one of evolutionary computations and is also a population-based algorithm. Traditionally, to demonstrate the convergence analysis of the PSO algorithm or its related variations, simulation results in a numerical presentation are often given. This way may be unclear or unsuitable for some particular cases. Hence, this paper will adopt the illustration styles instead of numeric simulation results to more clearly clarify the convergence behavior of the algorithm. In addition, it is well known that three parameters used in the algorithm, i.e., the inertia weight w, position constants c1 and c2, sufficiently dominate the whole searching performance. The influence of these parameter settings on the algorithm convergence will be considered and examined via a simple two-dimensional function optimization problem. All simulation results are displayed using a series of illustrations with respect to various iteration numbers. Finally, some simple rules on how to suitably assign these parameters are also suggested
Index Terms—Particle swarm optimization (PSO), convergence analysis, illustration styles.
W. D. Chang is with the Department of Computer and Communication, Shu-Te University, Kaohsiung, Taiwan (e-mail: wdchang@stu.edu.tw).
[PDF]
Cite: Wei-Der Chang, "Convergence Analysis of Particle Swarm Optimization via Illustration Styles," International Journal of Future Computer and Communication vol. 10, no. 3, pp. 29-37, 2021.
Copyright © 2021 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
