Abstract
Particle Swarm Optimization (PSO) has recently emerged as a nature-inspired algorithm for real parameter optimization. This article describes a method for improving the final accuracy and the convergence speed of PSO by firstly adding a new coefficient (called mobility factor) to the position updating equation and secondly modulating the inertia weight according to the distance between a particle and the globally best position found so far. The two-fold modification tries to balance between the explorative and exploitative tendencies of the swarm with an objective of achieving better search performance. We also mathematically analyze the effect of the modifications on the dynamics of the PSO algorithm. The new algorithm has been shown to be statistically significantly better than the basic PSO and four of its state-of-the-art variants on a twelve-function test-suite in terms of speed, accuracy, and robustness.



Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.References
Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks, pp 1942–1948
Eberhart RC, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the 6th international symposium on micromachine human science, vol 1, pp 39–43
Reynolds C (1987) Flocks, herds and schools: a distributed behavioral model.” SIGGRAPH ‘87: proceedings of the 14th annual conference on computer graphics and interactive techniques (Association for Computing Machinery), pp 25–34
Kennedy J, Eberhart RC, Shi Y (2001) Swarm Intelligence. Morgan Kaufmann, San Francisco, CA
Engelbrecht AP (2006) Fundamentals of computational swarm intelligence. John Wiley & Sons, London
Clerc M (2008) Particle swarm optimization. ISTE Publications, Eugene
del Valle Y, Venayagamoorthy GK, Mohagheghi S, Hernandez JC, Harley RG (2008) Particle swarm optimization: basic concepts, variants and applications in power systems. IEEE Transactions on Evolutionary Computation 12(2):171–195
Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part I: background and development. Natural Computing: An International Journal 6(4):467–484
Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Natural Computing: An International Journal 7(2):109–124
Ramana Murthy G, Senthil Arumugam M, Loo CK (2009) Hybrid particle swarm optimization algorithm with fine tuning operators. Int J Bio Inspired Comput 1(1/2)
Yuen D, Chen Q (2010) Particle swarm optimization with forgetting character. Int J Bio Inspired Comput 2(1):59–64
Kumar R, Sharma D, Kumar A (2009) A new hybrid multi-agent particle swarm optimization technique. Int J Bio Inspired Comput 2(1):259–269
Janson S, Middendorf M (2005) A hierarchical particle swarm optimizer and its adaptive variant. IEEE Transactions on Systems, Man, and Cybernetics—Part B. Cybernetics 35(6):1272–1282
Ozcan E, Mohan CK (1998) Analysis of a simple particle swarm optimization system. In: Intelligent engineering systems through artificial neural networks, pp 253–258
Ozcan E, Mohan CK (1999) Particle swarm optimization: surfing the waves. In: Proceedings of IEEE congress on evolutionary computation (CEC 1999), Washington, pp 1939–1944
Clerc M, Kennedy J (2002) The particle swarm-explosion, stability and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6(2):58–73
Kadirkamanathan V, Selvarajah K, Fleming PJ (2006) Stability analysis of the particle dynamics in particle swarm optimizer. IEEE Transactions on Evolutionary Computation 10(3):245–255
Jiang M, Luo YP, Yang SY (2007) Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Information Processing Letters 102:8–16
Trelea IC (2003) The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85:317–325
Samal NR, Konar A, Das S, Abraham A (2007) A closed loop stability analysis and parameter selection of the particle swarm optimization dynamics for faster convergence. In: Proceedings of congress of evolution and computation (CEC 2007), Singapore, pp 1769–1776
Eberhart RC, Shi Y (2001) Particle swarm optimization: developments, applications and resources. In: Proceedings of IEEE international conference on evolutionary computation, vol 81–86
Yao X, Liu Y, Lin G (1999) Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation 3(2):82–102
Suganthan PN, Hansen N, Liang JJ, Deb K, Chen Y-P, Auger A, Tiwari S (2005) Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical report, Nanyang Technological University, Singapore, May 2005 and KanGAL Report #2005005, IIT Kanpur, India
Shang YW, Qiu YH (2006) A note on the extended Rosenbrock function. Evolutionary Computation 14(1):119–126
Whitley D, Rana D, Dzubera J, Mathias E (1996) Evaluating evolutionary algorithms. Artif Intell 85:245–276
Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. Proceedings of IEEE International Conference Evolutionary Computation 3:101–106
Ratnaweera A, Halgamuge KS, Watson HC (2004) Self organizing hierarchical particle swarm optimizer with time-varying acceleration coefficients. IEEE Transactions on Evolutionary Computation 8(3):240–254
Parsopoulos KE, Vrahatis MN (2004) UPSO: a unified particle swarm optimization scheme. In: Lecture series on computer and computational sciences, vol 1. Proceedings of the international conference on computational methods, science and engineering (ICCMSE 2004), VSP International Science Publishers, Zeist, the Netherlands, pp 868–873
van den Bergh F, Engelbrecht AP (2004) A cooperative approach to particle swarm optimization. IEEE Transactions of Evolutionary Computation 8:225–239
van den Bergh F, Engelbrecht AP (2001) Effects of swarm size on cooperative particle swarm optimizers. In: Proceedings of GECCO-2001, San Francisco CA, pp 892–899
Fogel D, Beyer H-G (1995) A note on the empirical evaluation of intermediate recombination. Evolutionary Computation 3(4):491–495
Angeline PJ (1998) Evolutionary optimization versus particle swarm optimization: Philosophy and the performance difference. Lecture notes in computer science, vol 1447. In: Proceedings of 7th international conference on evolutionary programming—evolutionary programming VII, pp 84–89
Eiben AE, Hinterding R, Michalewicz Z (1999) Parameter control in evolutionary algorithms. IEEE Transactions on Evolutionary Computation 3(2):124–141
Wolpert D, Macready WG (1997) No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation 1(1):67–82
Acknowledgments
This work is supported by the Key Project of Chinese Ministry of Education under Grant 209021.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ghosh, S., Das, S., Kundu, D. et al. An inertia-adaptive particle swarm system with particle mobility factor for improved global optimization. Neural Comput & Applic 21, 237–250 (2012). https://doi.org/10.1007/s00521-010-0356-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00521-010-0356-x