Abstract
This paper proposes adaptive versions of the particle swarm optimization algorithm (PSO). These new algorithms present self-adaptive inertia weight and time-varying adaptive swarm topology techniques. The objective of these new approaches is to avoid premature convergence by executing the exploration and exploitation stages simultaneously. Although proposed PSOs are fundamentally based on commonly utilized swarm behaviors of swarming creatures, the novelty is that the whole swarm may divide into many sub-swarms in order to find a good source of food or to flee from predators. This behavior allows the particles to disperse through the search space (diversification) and the sub-swarm, where the worst performance dies out while that with the best performance grows by producing offspring. The tendency of an individual particle to avoid collision with other particles by means of simple neighborhood rules is retained in these algorithms. Numerical experiments show that the new approaches, survival sub-swarms adaptive PSO (SSS-APSO) and survival sub-swarms adaptive PSO with velocity-line bouncing (SSS-APSO-vb), outperform other competitive algorithms by providing the best solutions on a suite of standard test problem with a much higher consistency than the algorithms compared.
Access this article
Rent this article via DeepDyve
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig2_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig3_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig4_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig5_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig6_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig7_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig8_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig9_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig10_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig11_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1716-3/MediaObjects/500_2015_1716_Fig12_HTML.gif)
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Ai TJ, Kachitvichyanukul V (2007) Dispersion and velocity indices for observing dynamic behavior of particle swarm optimization. In: IEEE Congress on Evolutionary Computation, 2007. IEEE, Singapore, pp 3264–3271
Ai TJ, Kachitvichyanukul V (2008) A study on adaptive particle swarm optimization for solving vehicle routing problem. In: Proceedings of the 9th Asia Pacific industrial engineering & management systems conference, pp 2262–2268
Ai TJ, Kachitvichyanukul V (2009a) Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Comput Ind Eng 56:380–387
Ai TJ, Kachitvichyanukul V (2009b) A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 36:1693–1702
Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. part 1: background and development. Nat. Comput 6:467–484
Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. part 2: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat. Comput 7:109–124
Chen AL, Yang GK, Wu ZM (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. Zhejiang Univ Sci A 7(4):607–614
Chen MR, Li X, Zhang X, Lu YZ (2010) A novel particle swarm optimizer hybridized with extremal optimization. Appl Soft Comput 10:367–373
Clerc M, Kennedy J (2002) The particle swarm—explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–72
Deng W, Chen R, He B, Lu Y, Yin L, Gup J (2012) A novel two-stage hybrid swarm intelligence optimization algorithm and application. Soft Comput 6(10):1707–1722
Eberhart R, Kennedy J (1995) A new optimizer using particle swarm theory. In: Proceedings of the 6th international symposium on micro machine and human science, pp 39–43
Gang M, Wei Z, Xiaolin C (2012) A novel particle swarm optimization algorithm based on particle swarm migration. Appl Math Comput 218:6620–6626
Iwasaki N, Yasuda K, Ueno G (2006) Dynamic parameter tuning of particle swarm optimization. IEEJ Trans Electr Electr Eng 1:353–363
Jaing M, Luo Y, Yang Y (2007) Stochastic convergence analysis and parameter selection of the standard particle swarm optimization algorithm. Inf Process Lett 102:8–16
Kaewkamnerdpong B, Bentley PJ (2005a) Perceptive particle swarm optimization. In: Proceedings of the international conference on adaptive and natural computing algorithms, pp 259–263
Kaewkamnerdpong B, Bentley PJ (2005b) Perceptive particle swarm optimization: an investigate. In: Proceedings of 2005 IEEE on swarm intelligence symposium, pp 169–176
Kennedy J (1999) Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In: Proceedings of IEEE congress on evolutionary computation, pp 1931–1938
Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks IV, pp 1942–1948
Kennedy J, Mendes R (2002) Population structure and particle swarm performance. In: Proceedings of IEEE congress on evolutionary computation, pp 1671–1676
Krink T, Vesterstrom JS, Riget J (2002) Particle swarm optimisation with spatial particle extension. In: Proceedings of IEEE congress on evolutionary computation, pp 1474–1479
Leontitsis A, Kontogiorgos D, Pagge J (2006) Repel the swarm to the optimum. Appl Math Comput 173:265–272
Liu J, Ren X, Ma H (2012) A new PSO algorithm with random c/d switchings. Appl Math Comput 218:9579–9593
Marinakis Y, Marinaki M (2010) A hybrid multi-swarm particle optimization algorithm for the probabilistic traveling sales problem. Comput Oper Res 37:432–442
Melanie M (1999) An introduction to genetic algorithms. MIT Press, Cambridge
Nakagawa N, Ishigame A, Yasuda K (2009) Particle swarm optimization with velocity control. IEEJ Trans Elec Elect Eng 4:130–132
Pant M, Radha T, Singh VP (2007) A simple diversity guided particle swarm optimization. In: Proceedings of IEEE congress on evolutionary computation, pp 3294–3299
Parsopoulos KE, Vrahatis MN (2005) Unified particle swarm optimization for tackling operations research problems. In: Proceedings of swarm intelligence symposium SIS, pp 53–59
Parsopoulos KE, Vrahatis MN (2010) Particle swarm optimization and intelligence: advances and apllications, 1st edn. ISTE Ltd., Hershey
Reynolds CW (1987) Flocks, heards, and schools: a distributed behavioral model. In: Proceedings of the 14th annual conference on computer graphics and interactive techniques, pp 25–34
Riget J, Vesterstrom JS (2002) A diversity-guided particle swarm optimizer-the arpso. Tech. Rep. EVALife No.2002-02, Aarhus C, Denmark
Shelokar P, Siarry P, Jaryaraman V, Kulkarni B (2007) Particle swarm and ant colony algorithms hybridized for improved continuous optimization. Appl Math Comput 188:129–142
Shi Y, Eberhart RC (1998) A modified particle swarm optimizer. In: Proceedings of the evolutionary computation, pp 69–73
Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proceedings of the IEEE congress on evolutionary computation, pp 1945–1950
Shieh HL, Kuo CC, Chiang CM (2011) Modified particle swarm optimization algorithm with simultated annealing behavior and its numerical verification. Appl Math Comput 218:4365–4383
Tripathi PK, Bandyopadhyay S, Pal SK (2007) Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients. Int J Inf Sci 177:5033–5049
Ueno G, Yasuda K, Iwasaki N (2005) Robust adaptive particle swarm optimization. In: Proceedings of IEEE international conference on system, man and cybernetics, pp 3915–3020
van den Bergh F, Engelbrecht AP (2001) Effects of swarm size on cooperative particle swarm optimisers. In: Proceedings of genetic and evolutionary computation conference, pp 892–899
Veeramachaneni K, Peram T, Mohan C, Osadciw LA (2003) Optimization using particle swarms with near neighbor. In: Proceedings of genetic and evolutionary computation conference, pp 110–121
Xu G (2013) An adaptive parameter tuning of particle swarm optimization algorithm. Appl Math Comput 219:4560–4569
Xuanping Z, Yuping D, Guoqiang Q, Zheng Q (2005) Adaptive particle swarm algorithm with dynamically changing inertia weight. Xi’an Jiaotong Univ 39:1039–1042
Yang X, Yuan J, Yuan J, Mao H (2007) A modified particle swarm optimization with dynamic adaptation. Appl Math Comput 189:1205–1213
Yang S, Wang M, Jiao L (2004) A quantum particle swarm optimization. In: Proceedings of the IEEE congress on evolution computation, pp 320–324
Yasuda K, Iwasaki N, Ueno G, Aiyoshi E (2008) Particle swarm optimization: a numerical stability analysis and parameter adjustment based on swarm activity. IEEJ Trans Elec Elec Eng 3:642–659
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. Loia.
Rights and permissions
About this article
Cite this article
Pornsing, C., Sodhi, M.S. & Lamond, B.F. Novel self-adaptive particle swarm optimization methods. Soft Comput 20, 3579–3593 (2016). https://doi.org/10.1007/s00500-015-1716-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1716-3