Abstract
In this work we propose a different particle swarm optimization (PSO) algorithm that employs two key features of the conjugate gradient (CG) method. Namely, adaptive weight factor for each particle and iteration number (calculated as in the CG approach), and periodic restart. Experimental results for four well known test problems have showed the superiority of the new PSO-CG approach, compared with the classical PSO algorithm, in terms of convergence speed and quality of obtained solutions.
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
Angeline, P.: Evolutionary optimization versus particle swarm optimization: Philosophy and performance differences. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 601–610. Springer, Heidelberg (1998)
Blackwell, T., Bentley, P.: Dynamic search with charged swarms. In: Genetic and Evolutionary Computation Conference 2002 (GECCO), pp. 19–26 (2002)
Brits, R.: Niching strategies for particle swarm optimization. Master’s thesis, University of Pretoria, Pretoria (2002)
Chatterjee, A., Mukherjee, V., Ghoshal, S.: Velocity relaxed and craziness-based swarm optimized intelligent pid and pss controlled avr system. International Journal of Electrical Power and Energy Systems 31(7–8), 323–333 (2009)
Fletcher, R., Reeves, C.: Computer Journal  7, 149 (1964)
Fogel, D., Beyer, H.G.: A note on the empirical evaluation of intermediate recombination. Evolutionary Computation 3(4), 491–495 (1996)
Hu, X., Eberhart, R.: Multiobjective optimization using dynamic neighborhood particle swarm optimisation. In: The IEEE Congress on Evolutionary Computation (CEC), pp. 1677–1687 (2002)
Kawakami, K., Meng, A.: Improvement of particle swarm optimization. PIERS ONLINE 5(3), 261–266 (2009)
Kennedy, J.: Stereotyping: improving particle swarm performance with cluster analysis. In: The IEEE Congress on Evolutionary Computation (CEC), pp. 1507–1512 (2000)
Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proc. of the IEEE Int. Conf. on Neural Networks, Piscataway, NJ, USA, pp. 1942–1948 (1995)
Kennedy, J., Eberhart, R.: Swarm Intelligence. Morgan Kaufmann Publishers, San Francisco (2001)
Liu, Y., Qin, Z., Xu, Z.L., He, X.S.: Using relaxation velocity update strategy to improve particle swarm optimization. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics, vol. 4, pp. 2469–2472 (2004)
Payne, H., Teter, M., Allna, D.: Rev. Mod. Phys., pp. 1045–1097 (1992)
Settles, M., Soule, T.: Breeding swarm: A ga/pso hybrid. In: Genetic and Evolutionary Computation Conference 2005 (GECCO), Washington, USA, pp. 161–168 (2005)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 67–73 (1998)
Suganthan, P.: Particle swarm optimiser with neighbourhood operator. In: The IEEE Congress on Evolutionary Computation (CEC), pp. 1958–1962 (1999)
Wilke, D., Kok, S., Groenwold, A.: Using relaxation velocity update strategy to improve particle swarm optimization. International journal for numerical methods in engineering 70 (2007)
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
Qteish, A., Hamdan, M. (2010). Hybrid Particle Swarm and Conjugate Gradient Optimization Algorithm. 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_71
Download citation
DOI: https://doi.org/10.1007/978-3-642-13495-1_71
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)