Abstract
Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human communities. In order to get rid of the disadvantages of standard Particle Swarm Optimization algorithm like being trapped easily into a local optimum, this paper improves the standard PSO and proposes a new algorithm to solve these problems. The new algorithm keeps not only the fast convergence speed characteristic of PSO, but effectively improves the capability of global searching as well. Compared with standard PSO on the Benchmarks function, the new algorithm produces more efficient results.
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.
References
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)
Clare, 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)
Coello, C.A., Lechuga, M.S.: Mopso: A proposal for multiple objective particle swarm optimization. In: IEEE Proceedings World Congress on Computational Intelligence, pp. 1051–1056 (2002)
Kennedy, J.: The particle swarm: social adaptation of knowledge. In: Proc. IEEE int. Conf. on evolutionary computation, pp. 3003–3008 (1997)
Oscan, E., Mohan, C.K.: Analysis of A Simple Particle Swarm Optimization System. In: Intelligence Engineering Systems Through Artificial Neural Networks, pp. 253–258 (1998)
Clerc, M., Kennedy, J.: The Particle Swarm: Explosion, Stability and Convergence in a Multi-Dimensional Complex Space. IEEE Trans. on Evolutionary Computation 6, 58–73 (2002)
van den Bergh, F.: An Analysis of Particle Swarm Optimizers. PhD thesis, Department of Computer Science, University of Pretoria, South Africa (2002)
Parsopoulos, K.E., Vrahatis, M.N.: Particle Swarm Optimization Method in Multiobjective Problems. In: Proceedings of the 2002 Congress on Evolutionary Computation, Piscataway, NJ, pp. 46–53 (2000)
Clerc, M.: Discrete Particle Swarm Optimization Illustrated by the Traveling Salesman Problem (2000), http://www.mauriceclerc.net
Clerc, M., Kennedy, J.: The Particle Swarm: Explosion, Stability and Convergence in a Multi-Dimensional Complex Space. IEEE Trans. on Evolutionary Computation 6, 58–73 (2002)
Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the 2000 Congress on evolutionary computation, vol. 1, pp. 84–88 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yan, X., Wu, Q., Liu, H. (2009). A New Optimizaiton Algorithm for Function Optimization. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-04843-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04842-5
Online ISBN: 978-3-642-04843-2
eBook Packages: Computer ScienceComputer Science (R0)