Abstract
This study proposes an adaptive staged particle swarm optimization (ASPSO) algorithm based on analyses of particles’ search capabilities. First, the search processes of the standard PSO (SPSO) and the linear decreasing inertia weight PSO (LDWPSO) are analyzed based on our previous definition of exploitation. Second, three stages of the search process in PSO are defined. Each stage has its own search preference, which is represented by the exploitation capability of swarm. Third, the mapping between inertia weight, learning factor (w-c) and the exploitation capability is given. At last, the ASPSO is proposed. By setting different values of w-c in three stages, one can make swarm search the space with particular strategy in each stage, and the particles can be directed to find the solution more effectively. The experimental results show that the proposed ASPSO has better performance than SPSO and LDWPSO on most of test functions.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. of the IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Poli, R.: Analysis of the publications on the applications of particle swarm optimization. Journal of Artificial Evolution and Applications 2008, Article No. 4 (2008)
Shi, Y.H., Eberhart, R.C.: Parameter selection in particle swarm optimization. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 591–600. Springer, Heidelberg (1998)
Chatterjee, A., Siarry, P.: Nonlinear inertia weight variation for dynamic adaptation particle swarm optimization. Computers and Operations Research 33, 859–871 (2006)
Feng, Y., Teng, G.F., Wang, A.X., Yao, Y.M.: Chaotic Inertia Weight in Particle Swarm Optimization. In: Second International Conference on Innovative Computing, Information and Control, pp. 475–478 (2007)
Bratton, D., Kennedy, J.: Defining a standard for particle swarm optimization. In: Proc. of the IEEE Swarm Intelligence Symposlum(SIS), pp. 120–127 (2007)
Clerc, M., Kennedy, J.: The Particle Swarm-Explosion, Stability, and Convergence in a Multidimensional Complex Space. IEEE Trans. on Evolutionary Computation 6(1), 58–73 (2002)
Zhang, J.Q., Liu, K., Tan, Y., He, X.G.: Allocation of Local and Global Search Capabilities of Particle in Canonical PSO. In: GECCO 2008, Atlanta, Georgia, USA, pp. 165–166 (2008)
Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization (2005), http://www.ntu.edu.sg/home/EPNSugan
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, K., Tan, Y., He, X. (2010). An Adaptive Staged PSO Based on Particles’ Search Capabilities. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13495-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-13495-1_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13494-4
Online ISBN: 978-3-642-13495-1
eBook Packages: Computer ScienceComputer Science (R0)