Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 159495, 17 pages
http://dx.doi.org/10.1155/2013/159495
Research Article

A New Improved Quantum Evolution Algorithm with Local Search Procedure for Capacitated Vehicle Routing Problem

School of Management, Huazhong University of Science and Technology, Wuhan, Hubei 430074, China

Received 26 June 2013; Accepted 11 October 2013

Academic Editor: John Gunnar Carlsson

Copyright © 2013 Ligang Cui et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. G. B. Dantzig and J. H. Ramser, “The truck dispatching problem,” Management Science, vol. 6, no. 1, pp. 80–91, 1959. View at Google Scholar · View at MathSciNet
  2. J. G. Carlsson, “Dividing a territory among several vehicles,” INFORMS Journal on Computing, vol. 24, no. 4, pp. 565–577, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  3. J. G. Carlsson and E. Delage, “Robust partitioning for stochastic multivehicle routing,” Operations Research, vol. 61, no. 3, pp. 727–744, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. G. Laporte, “The vehicle routing problem: an overview of exact and approximate algorithms,” European Journal of Operational Research, vol. 59, no. 3, pp. 345–358, 1992. View at Google Scholar · View at Scopus
  5. B. F. Moghaddam, R. GarcÍa, and S. J. Sadjadi, “Vehicle routing problem with uncertain demands: an advanced particle swarm algorithm,” Computers and Industrial Engineering, vol. 62, no. 1, pp. 306–317, 2012. View at Publisher · View at Google Scholar · View at Scopus
  6. J. K. Lenstra and A. H. G. Kan, “Complexity of vehicle routing and scheduling problems,” Networks, vol. 11, no. 2, pp. 221–227, 1981. View at Google Scholar · View at Scopus
  7. T. J. Ai and V. Kachitvichyanukul, “A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery,” Computers and Operations Research, vol. 36, no. 5, pp. 1693–1702, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. G. Laporte, “Fifty years of vehicle routing,” Transportation Science, vol. 43, no. 4, pp. 408–416, 2009. View at Publisher · View at Google Scholar · View at Scopus
  9. B. L. Golden, S. Raghavan, and E. A. Wasil, The Vehicle Routing Problem: Latest Advances and New Challenges, vol. 43 of Operations Research/Computer Science Interfaces Series, Springer, New York, NY, USA, 2008. View at MathSciNet
  10. C. H. Vera, F. D. Karl, and F. H. Richard, “A variable neighborhood search heuristic for periodic routing problems,” European Journal of Operational Research, vol. 195, no. 3, pp. 791–802, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. B. M. Baker and M. Ayechew, “A genetic algorithm for the vehicle routing problem,” Computers and Operations Research, vol. 30, no. 5, pp. 787–800, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. C. Rego and B. Alidaee, Metaheuristic Optimization via Memory and Evolution, vol. 30 of Operations Research/Computer Science Interfaces Series, Kluwer Academic, Boston, Mass, USA, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  13. Y. Marinakis, M. Marinaki, and G. Dounias, “A hybrid particle swarm optimization algorithm for the vehicle routing problem,” Engineering Applications of Artificial Intelligence, vol. 23, no. 4, pp. 463–472, 2010. View at Publisher · View at Google Scholar · View at Scopus
  14. W. Y. Szeto, Y. Z. Wu, and C. H. Sin, “An artificial bee colony algorithm for the capacitated vehicle routing problem,” European Journal of Operational Research, vol. 215, no. 1, pp. 126–135, 2011. View at Publisher · View at Google Scholar · View at Scopus
  15. A. Narayanan and M. Moore, “Quantum-inspired genetic algorithms,” in Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 61–66, Nagoya, Japan, May 1996. View at Scopus
  16. Z. Luo, P. Wang, Y. G. Li, W. F. Zhang, W. Tang, and M. Xiang, “Quantum-inspired evolutionary tuning of SVM parameters,” Progress in Natural Science, vol. 18, no. 4, pp. 475–480, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  17. A. D. S. Nicolau, R. Schirru, and A. M. M. de Lima, “Nuclear reactor reload using quantum inspired algorithm,” Progress in Nuclear Energy, vol. 55, pp. 40–48, 2012. View at Publisher · View at Google Scholar · View at Scopus
  18. J. L. Zhang, Y. W. Zhao, D. J. Peng, and W. L. Wang, “A hybrid quantum-inspired evolutionary algorithm for capacitated vehicle routing problem,” in Advanced Intelligent Computing Theories and Applications: With Aspects of Theoretical and Methodological Issues, vol. 5226 of Lecture Notes in Computer Science, pp. 31–38, 2008. View at Publisher · View at Google Scholar · View at Scopus
  19. J. Zhang, W. L. Wang, Y. W. Zhao, and C. Cattani, “Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction,” Mathematical Problem in Engineering, vol. 2012, Article ID 879614, 19 pages, 2012. View at Publisher · View at Google Scholar
  20. R. Zhang and H. Gao, “Real-coded quantum evolutionary algorithm for complex functions with high-dimension,” in Proceedings of the IEEE International Conference on Mechatronics and Automation (ICMA '07), pp. 2974–2979, Luoyang, China, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  21. P. L. Li and S. Y. Li, “Quantum-inspired evolutionary algorithm for continuous space optimization,” Chinese Journal of Electronics, vol. 17, no. 1, pp. 80–84, 2008. View at Google Scholar · View at Scopus
  22. F. J. Hu and B. Wu, “Quantum evolutionary algorithm for vehicle routing problem with simultaneous delivery and pickup,” in Proceedings of the 48th IEEE Conference on Decision and Control, pp. 5097–5101, Shanghai, China, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  23. J. Gao and J. Wang, “A hybrid quantum-inspired immune algorithm for multiobjective optimization,” Applied Mathematics and Computation, vol. 217, no. 9, pp. 4754–4770, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  24. M. Chen, Z. Ouyang, and H. Quan, “Evolutionary algorithm based on evaluating quantum chromosomes,” Computer Engineering and Applications, vol. 43, no. 21, pp. 84–86, 2007. View at Google Scholar
  25. J. C. Lee, W. M. Lin, G.-C. Liao, and T. P. Tsao, “Quantum genetic algorithm for dynamic economic dispatch with valve-point effects and including wind power system,” International Journal of Electrical Power and Energy Systems, vol. 33, no. 2, pp. 189–197, 2011. View at Publisher · View at Google Scholar · View at Scopus
  26. K. Han, K. Park, C. Lee, and J. Kim, “Parallel quantum-inspired genetic algorithm for combinatorial optimization problem,” in Proceedings of the Congress on Evolutionary Computation, vol. 2, pp. 1422–1429, Seoul, Republic of Korea, May 2001.
  27. T. C. Lu and J. C. Juang, “Quantum-inspired space search algorithm (QSSA) for global numerical optimization,” Applied Mathematics and Computation, vol. 218, no. 6, pp. 2516–2532, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  28. G. Benenti, G. Casati, and G. Strini, Principles of Quantum Computation and Information: Basic Tools and Special Topics, World Scientific, River Edge, NJ, USA, 2007. View at MathSciNet
  29. Z. Li, R. Gunter, and K. Li, “Convergence performance comparison of quantum-inspired multi-objective evolutionary algorithms,” Computers and Mathematics with Applications, vol. 57, no. 11, pp. 1843–1854, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. M. Ying, “Quantum computation, quantum theory and AI,” Artificial Intelligence, vol. 174, no. 2, pp. 162–176, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  31. T. Zheng and M. Yamashiro, “Solving flow shop scheduling problems by quantum differential evolutionary algorithm,” The International Journal of Advanced Manufacturing Technology, vol. 49, no. 5–8, pp. 643–662, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. H. Su, Y. Yang, and L. Zhao, “Classification rule discovery with DE/QDE algorithm,” Expert Systems with Applications, vol. 37, no. 2, pp. 1216–1222, 2010. View at Publisher · View at Google Scholar · View at Scopus
  33. H. Su and Y. Yang, “Differential evolution and quantum-inquired differential evolution for evolving Takagi-Sugeno fuzzy models,” Expert Systems with Applications, vol. 38, no. 6, pp. 6447–6451, 2011. View at Publisher · View at Google Scholar · View at Scopus
  34. J. Sun, B. Feng, and W. Xu, “Particle swarm optimization with particles having quantum behavior,” in Proceedings of the Congress on Evolutionary Computation (CEC '04), vol. 1, pp. 325–331, Portland, Ore, USA, June 2004. View at Scopus
  35. S. N. Omkar, R. Khandelwal, T. V. S. Ananth, G. N. Naik, and S. Gopalakrishnan, “Quantum behaved particle swarm optimization (QPSO) for multi-objective design optimization of composite structures,” Expert Systems with Applications, vol. 36, no. 8, pp. 11312–11322, 2009. View at Publisher · View at Google Scholar · View at Scopus
  36. P. L. Li and S. Y. Li, “Quantum-inspired evolutionary algorithm for continuous space optimization based on Bloch coordinates of qubits,” Neurocomputing, vol. 72, no. 1–3, pp. 581–591, 2008. View at Publisher · View at Google Scholar · View at Scopus
  37. J. Gu, X. Gu, and M. Gu, “A novel parallel quantum genetic algorithm for stochastic job shop scheduling,” Journal of Mathematical Analysis and Applications, vol. 355, no. 1, pp. 63–81, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  38. J. Gu, M. Gu, C. Cao, and X. Gu, “A novel competitive co-evolutionary quantum genetic algorithm for stochastic job shop scheduling problem,” Computers and Operations Research, vol. 37, no. 5, pp. 927–937, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  39. Y. Li, P. Pardalos, and M. Resende, “A greedy randomized adaptive search procedure for the quadratic assignment problem,” in Quadratic Assignment and Related Problems, vol. 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pp. 237–261, American Mathematical Society, Providence, RI, USA, 1994. View at Google Scholar
  40. W. C. Chiang, “The application of a tabu search metaheuristic to the assembly line balancing problem,” Annals of Operations Research, vol. 77, pp. 209–227, 1998. View at Google Scholar · View at Scopus
  41. O. Bräysy, “A reactive variable neighborhood search for the vehicle-routing problem with time windows,” INFORMS Journal on Computing, vol. 15, no. 4, pp. 347–368, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  42. N. Christofides, A. Mingozzi, and P. Toth, “The vehicle routing problem,” in Combinatorial Optimization, vol. 11, pp. 315–338, John Wiley and Sons, Chichester, UK, 1979. View at Google Scholar
  43. A. Chen, G. Yang, and Z. Wu, “Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem,” Journal of Zhejiang University A, vol. 7, no. 4, pp. 607–614, 2006. View at Google Scholar