Quantum-Behaved Particle Swarm Optimization Algorithm Based on Border Mutation and Chaos for Vehicle Routing Problem

  • Ya Li
  • Dan Li
  • Dong Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7331)


A quantum-behaved particle swarm optimization based on border mutation and chaos is proposed for vehicle routing problem(VRP).Based on classical Quantum-Behaved Particle Swarm Optimization algorithm(QPSO), when the algorithm is trapped in local optimum, chaotic search is used for the optimal particles to enhance the optimization ability of the algorithm, avoid getting into local optimum and premature convergence. To thosecross-border particles,mutation strategy is used to increase the variety of swarm and strengthen the global search capability. This algorithm is applied to vehicle routing problem to achieve good results.


QPSO Chaos Border mutation 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: 4th IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE Press, Australia (1995)Google Scholar
  2. 2.
    Shi, Y., Eberhart, R.C.: A modified particle swarm optimizer. In: The IEEE International Conference on Evolutionary Computation, pp. 69–73. IEEE Press, Piscataway (1998)Google Scholar
  3. 3.
    Clerc, M.: The swarm and the queen towards a deterministic and adaptive particle swarm optimization. In: The Congress on Evolutionary Computation, pp. 1951–1957. IEEE Press, Piscataway (1999)Google Scholar
  4. 4.
    Gao, Y., Xie, S.L.: Chaos Particle Swarm Optimization Algorithm. J. Computer Science 31(8), 13–15 (2004)Google Scholar
  5. 5.
    Sun, J., Xu, W.B., Feng, B.: A global search strategy of quantum-behaved particle swarm optimization. In: The IEEE Conference on Cybernetics and Intelligent Systems, pp. 111–116. IEEE Press, Piscataway (2004)Google Scholar
  6. 6.
    Li, N., Zhou, T., Sun, D.B.: Particle swarm optimization for vehicle routing problem. J. Systems Engineering 19(6), 597 (2004)Google Scholar
  7. 7.
    Clerc, M., Kennedy, J.: The particle swarm: Explosion, stability and convergence in a multi-dimensional complex space. J. IEEE Transactions on Evolutionary Computation 6(1), 58–73 (2002)CrossRefGoogle Scholar
  8. 8.
    Sun, J., Feng, B., Xu, W.B.: Particle swarm optimization with particles having quantum behavior. In: The Congress on Evolutionary Computation, pp. 325–331. IEEE Press, Portland (2004)Google Scholar
  9. 9.
    Gao, S., Yang, J.Y.: Research on Chaos Particle Swarm Optimization Algorithm. J. Pattern Recognition and Artificial Intelligence. 19(2), 266–270 (2006)Google Scholar
  10. 10.
    Duan, X.D., Gao, H.X., Zhang, X.D., Liu, X.D.: Relations between Population Structure and Population Diversity of Particle Swarm Optimization Algorithm. J. Computer Science. 34(11), 164–166 (2007)Google Scholar
  11. 11.
    Meng, H.J., Zhen, P., Mei, G.H., Xie, Z.: Particle Swarm Optimization Technical report of Zhejiang University of Technology (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Ya Li
    • 1
  • Dan Li
    • 2
  • Dong Wang
    • 1
  1. 1.Dept. of Computer, School of Electrical&Information EngineeringFoshan UniversityFoshanChina
  2. 2.Technology&Information CenterXinYang Power Supply CompanyXinyangChina

Personalised recommendations