Advertisement

Improving Quantum-Behaved Particle Swarm Optimization by Simulated Annealing

  • Jing Liu
  • Jun Sun
  • Wenbo Xu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4115)

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.

Keywords

Particle Swarm Optimization Simulated Annealing Particle Swarm Particle Swarm Optimization Algorithm Simulated Annealing Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proc. IEEE Conf. On Neural Network, pp. 1942–1948 (1995)Google Scholar
  2. 2.
    Angeline, P.J.: Using Selection to Improve Particle Swarm Optimization. In: Proceedings of the IEEE Conference on Evolutionary Computation, ICEC, pp. 84–89 (1998)Google Scholar
  3. 3.
    Rasussen, M.T.K., Krink., T.: Hybrid Particle Swarm Optimiser with Breeding and Subpopulations. In: Proc. the third Genetic and Evolutionary Computation Conferences (2001)Google Scholar
  4. 4.
    Kennedy, J.: Bare Bones Particle Swarms. In: IEEE Swarm Intelligence Symposium, pp. 80–87 (2003)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Shi, Y., Eberhart, R.: Empirical Study of Particle Swarm Optimization. In: Proc. Congress on Evolutionary Computation, pp. 1945–1950 (1999)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar
  9. 9.
    Metropolis, N., et al.: Equations of State Calculations by Fast Computing Machines. J. Chem. Phys., 1087–1092 (1958)Google Scholar
  10. 10.
    Davis, L.: Genetic Algorithms and Simulated Annealing. Pitman Publishing, London (1987)MATHGoogle Scholar
  11. 11.
    Riget, V.J.S.: A Diversity-Guided Particle Swarm Optimizer-ARPSO, Denmark (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jing Liu
    • 1
  • Jun Sun
    • 1
  • Wenbo Xu
    • 1
  1. 1.School of Information TechnologySouthern Yangtze UniversityWuxi, JiangsuChina

Personalised recommendations