Abstract
The speed equation of particle swarm optimization is improved by using a convex combination of the current best position of a particle and the current best position which the whole particle swarm as well as the current position of the particle, so as to enhance global search capability of basic particle swarm optimization. Thus a new particle swarm optimization algorithm is proposed. Numerical experiments show that its computing time is short and its global search capability is powerful as well as its computing accuracy is high in compared with the basic PSO.
The work is supported by the National Natural Science Foundation of China under Grant No.60962006 and the Natural Science Foundation of Ningxia under Grant No.NZ0848.
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.: Particle swarm optimization. In: IEEE Int. Conf. Neural Networks, Perth, Australia, vol. 11, pp. 1942–1948 (1995)
Zhu, J., Gu, X.S., Jiao, B.: A novel particle swarm optimization algorithm for short- term scheduling of batch plants with parallel units. International Journal of Computational Intelligence Research 4 (2008)
Izui, K., Nishiwaki, S., Yoshimura, M.: Enhanced multiobjective particle swarm optimization in combination with adaptive weighted gradient-based searching. Engineering Optimization 40(9), 789–804 (2008)
Po-Hung, C., Cheng-Chien, K., Fu-Hsien, C., Cheng-Chuan, C.: Refined Binary Particle Swarm Optimization and Application in Power System. Wseas transaction on system 8(2), 169–178 (2009)
Yi, T.K., Erwie, Z.: A hybrid genetic algorithm and particle swarm optimization for multimodal functions. Applied Soft Computing Journal 8, 849–857 (2008)
Yuelin, G., Zihui, R.: Adaptive particle swarm optimization algorithm with genetic mutation operation. In: Proceedings of the Third International Conference on Natural Computation, vol. 2, p. 211–215(2007)
Maurice, C.: Particle swarm optimization. Great Britain and the United States, ISTE Ltd. (2006)
Shi, Y., Eberhart, R.: Empirical study of particle swarm optimization. In: Proceedings of The 1999 Congress of Evolutionary Computation, pp. 1945–1950. IEEE Press, Los Alamitos (1999)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. Evol. Comput. 3, 82–102 (1999)
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
Gao, Y., Lei, F., Wang, M. (2010). A New Particle Swarm Optimization Algorithm and Its Numerical Analysis. 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_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-13495-1_8
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)