Abstract
The discrete formulation of Particle Swarm Optimization (PSO) is nowadays widely used. The paper presents a continuous formulation of the PSO problem along with its analytic solution. The aim is to verify whenever an amelioration of the standard discrete PSO is achievable by employing its continuous counterpart. The convergence of the proposed continuous PSO scheme is analyzed accounting for variation of the algorithm’s parameters. Moreover, looking for the minimization of an a-priori chosen modified Rastringrin function, a comparison with the standard PSO is also given in terms of computational time and likelihood of success of finding the global optimum points using a Monte Carlo like analysis to consider the stochastic nature of the PSO. Last, comparisons with other optimization methods such as genetic algorithm and tabu search as well as with some extension PSO methods have been investigated. Different objective functions have been taken into account and a success rate greater that \(93\%\) has always been obtained.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability Statement
Not applicable.
References
Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: MHS’95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science, pp. 39–43 (1995)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: 1998 IEEE international conference on evolutionary computation proceedings. IEEE world congress on computational intelligence (Cat. No. 98TH8360), pp. 69–73 (1998)
Garcia-Gonzalo, E., Fernández-Martínez, J.L.: A brief historical review of particle swarm optimization (PSO). J. Bioinform. Intell. Control 1(1), 3–16 (2012)
Song, M.-P., Gu, G.-C.: Research on particle swarm optimization: a review. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No. 04EX826), vol. 4, pp. 2236–2241 (2004)
Poli, R.: Analysis of the publications on the applications of particle swarm optimisation. J. Artif. Evol. Appl. 2008, (2008). https://doi.org/10.1155/2008/685175
Tanweer, M.R., Suresh, S., Sundararajan, N.: Self regulating particle swarm optimization algorithm. Inform. Sci. 294, 182–202 (2015)
Orlando, C., Alaimo, A.: A robust active control system for shimmy damping in the presence of free play and uncertainties. Mech. Syst. Signal Process. 84, 551–569 (2017)
Sun, J., Xu, W., Feng, B.: A global search strategy of quantum-behaved particle swarm optimization. In: IEEE Conference on Cybernetics and Intelligent Systems, vol. 1, pp. 111–116 (2004)
Sedighizadeh, D., Masehian, Ellips: Particle swarm optimization methods, taxonomy and applications. Int. J. Comput. Theory Eng. 1(5), 394–397 (2009)
Song, S., Lu, B., Kong, L., Cheng, J.: A novel PSO algorithm model based on population migration strategy and its application. J. Comput. 6(2), 280–287 (2011)
Zhang, Y., Lenan, W.: A hybrid TS-PSO optimization algorithm. J. Converg. Inform. Technol. 6(5), 169–174 (2011)
Tian, D.P.: A Review of Convergence Analysis of Particle Swarm Optimization. Int. J. Grid Distrib. Comput. 6(6), 117–128 (2013)
Funding
Not applicable.
Author information
Authors and Affiliations
Contributions
Not applicable.
Corresponding author
Ethics declarations
Code Availability
Not applicable.
Conflict of interest
The authors declare that they have no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Orlando, C., Ricciardello, A. Analytic solution of the continuous particle swarm optimization problem. Optim Lett 15, 2005–2015 (2021). https://doi.org/10.1007/s11590-020-01671-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-020-01671-3