Abstract
Quantum-behaved Particle Swarm Optimization (QPSO) is a global convergence guaranteed search method, which introduced quantum theory into original Particle Swarm Optimization (PSO). While Simulated Annealing (SA) is another important stochastic optimization with the ability of probabilistic hill-climbing. In this paper, the mechanism of Simulated Annealing is introduced into the weak selection implicit in our QPSO algorithm, which effectively employs both the ability to jump out of the local minima in Simulated Annealing and the capacity of searching the global optimum in QPSO algorithm. The experimental results show that the proposed hybrid algorithm increases the diversity of the population in the search process and improves its precision in the latter period of the search.
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.: Particle Swarm Optimization. In: Proc. IEEE Conf. On Neural Network, pp. 1942–1948 (1995)
Angeline, P.J.: Using Selection to Improve Particle Swarm Optimization. In: Proceedings of the IEEE Conference on Evolutionary Computation, ICEC, pp. 84–89 (1998)
Rasussen, M.T.K., Krink., T.: Hybrid Particle Swarm Optimiser with Breeding and Subpopulations. In: Proc. the third Genetic and Evolutionary Computation Conferences (2001)
Kennedy, J.: Bare Bones Particle Swarms. In: IEEE Swarm Intelligence Symposium, pp. 80–87 (2003)
Sun, J., Feng, B., Xu, W.: Particle Swarm Optimization with Particles Having Quantum Behavior. In: IEEE Proc.Congress on Evolutionary Computation, pp. 325–331 (2004)
Shi, Y., Eberhart, R.: Empirical Study of Particle Swarm Optimization. In: Proc. Congress on Evolutionary Computation, pp. 1945–1950 (1999)
Clerc, M., Kennedy, K.: The Particle Swarm: Explosion, Stability and Convergence in a Multi-Dimensional Complex Space. IEEE Transaction on Evolutionary Computation 6, 58–73 (2002)
Sun, J., et al.: A Global Search Strategy of Quantum-behaved Particle Swarm Optimization. In: IEEE conference on Cybernetics and Intelligent Systems, pp. 111–116 (2004)
Metropolis, N., et al.: Equations of State Calculations by Fast Computing Machines. J. Chem. Phys., 1087–1092 (1958)
Davis, L.: Genetic Algorithms and Simulated Annealing. Pitman Publishing, London (1987)
Riget, V.J.S.: A Diversity-Guided Particle Swarm Optimizer-ARPSO, Denmark (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, J., Sun, J., Xu, W. (2006). Improving Quantum-Behaved Particle Swarm Optimization by Simulated Annealing. In: Huang, DS., Li, K., Irwin, G.W. (eds) Computational Intelligence and Bioinformatics. ICIC 2006. Lecture Notes in Computer Science(), vol 4115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816102_14
Download citation
DOI: https://doi.org/10.1007/11816102_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37277-6
Online ISBN: 978-3-540-37282-0
eBook Packages: Computer ScienceComputer Science (R0)