Abstract
Particle Swarm Optimization (PSO) algorithms are swarm intelligence methods that are effective in solving optimization problems. However, current techniques have some drawbacks: the particles of some PSO implementations are sensible to their input hyper-parameters, lack direction diversity in their movement, have rotational variance, and might prematurely converge due to rapid swarm diversity loss. This article addresses these issues by introducing Rotationally Invariant Attractive and Repulsive eXpanded PSO (RI-AR-XPSO) and Rotationally Invariant Semi-Autonomous eXpanded PSO (RI-SAXPSO) as improvements of Rotationally Invariant Semi-Autonomous PSO (RI-SAPSO) and eXpanded PSO (XPSO). Their swarm behavior was evaluated with classic functions in the literature and their accuracy was tested with the Congress on Evolutionary Computation (CEC) 2017 optimization problems, in whose results a statistical significance test was applied. The results obtained attest that strategies such as diversity control, automatic hyper-parameter adjustment, directional diversity, and rotational invariance improve performance without accuracy loss when adequately implemented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Awad, N., Ali, M., Liang, J.J., Qu, B., Suganthan, P.: Problem definitions and evaluation criteria for the CEC 2017 special session and competition on single objective real-parameter numerical optimization. Technical report (2016)
Bonyadi, M.R., Michalewicz, Z.: A locally convergent rotationally invariant particle swarm optimization algorithm. Swarm Intell. 8(3), 159–198 (2014)
Derrac, J., García, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. SEC 1(1), 3–18 (2011)
Drake, J.H., Kheiri, A., Özcan, E., Burke, E.K.: Recent advances in selection hyper-heuristics. Eur. J. Oper. Res. 285(2), 405–428 (2020)
Eberhart, R., Kennedy, J.: Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Han, F., Liu, Q.: A diversity-guided hybrid particle swarm optimization based on gradient search. Neurocomputing 137, 234–240 (2014)
Hansen, N., Ros, R., Mauny, N., Schoenauer, M., Auger, A.: Impacts of invariance in search: when CMA-ES and PSO face ill-conditioned and non-separable problems. Appl. Soft Comput. 11(8), 5755–5769 (2011)
Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (2012)
Horst, R., Tuy, H.: Global optimization: deterministic approaches. SBH (1996)
Janson, S., Middendorf, M.: On trajectories of particles in PSO. In: 2007 IEEE Swarm Intelligence Symposium, pp. 150–155. IEEE (2007)
Liu, X.F., Zhan, Z.H., Gao, Y., Zhang, J., Kwong, S., Zhang, J.: Coevolutionary particle swarm optimization with bottleneck objective learning strategy for many-objective optimization. IEEE TEC 23(4), 587–602 (2019)
Noel, M.M.: A new gradient based particle swarm optimization algorithm for accurate computation of global minimum. ASC 12(1), 353–359 (2012)
Riget, J., Vesterstrøm, J.S.: A diversity-guided particle swarm optimizer-the ARPSO. Department of Computer Science, Univ. of Aarhus, Aarhus, Denmark, Technical report 2 (2002)
Santos, R., Borges, G., Santos, A., Silva, M., Sales, C., Costa, J.C.A.: A rotationally invariant semi-autonomous particle swarm optimizer with directional diversity. Swarm Evol. Comput. 56, 100700 (2020)
Santos, R., Borges, G., Santos, A., Silva, M., Sales, C., Costa, J.C.: A semi-autonomous particle swarm optimizer based on gradient information and diversity control for global optimization. Appl. Soft Comput. 69, 330–343 (2018)
Santos, R., Borges, G., Santos, A., Silva, M., Sales, C., Costa, J.C.: Empirical study on rotation and information exchange in particle swarm optimization. In: SEC (2019)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: 1998 IEEE International Conference on Evolutionary Computation Proceedings (1998)
Spears, W., Green, D., Spears, D.: Biases in particle swarm optimization. IJSIR 1, 34–57 (2010)
Wilke, D.N., Kok, S., Groenwold, A.A.: Comparison of linear and classical velocity update rules in particle swarm optimization: notes on diversity. In: IJNME (2007)
Wilke, D.N., Kok, S., Groenwold, A.A.: Comparison of linear and classical velocity update rules in particle swarm optimization: notes on scale and frame invariance. Int. J. Numer. Meth. Eng. 70(8), 985–1008 (2007)
Xia, X., et al.: An expanded particle swarm optimization based on multi-exemplar and forgetting ability. Inf. Sci. 508, 105–120 (2020)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Vasconcelos, M., Flexa, C., Moreira, I., Santos, R., Sales, C. (2021). Improving Particle Swarm Optimization with Self-adaptive Parameters, Rotational Invariance, and Diversity Control. In: Britto, A., Valdivia Delgado, K. (eds) Intelligent Systems. BRACIS 2021. Lecture Notes in Computer Science(), vol 13073. Springer, Cham. https://doi.org/10.1007/978-3-030-91702-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-030-91702-9_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91701-2
Online ISBN: 978-3-030-91702-9
eBook Packages: Computer ScienceComputer Science (R0)