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

An Improved Ant Colony Algorithm and Its Application in Vehicle Routing Problem

School of Software Engineering, South China University of Technology, Guangzhou, Guangdong 510006, China

Received 6 August 2013; Revised 16 October 2013; Accepted 18 October 2013

Academic Editor: Ali Davoudi

Copyright © 2013 Min Huang and Ping Ding. 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. R.-M. Chen and C.-M. Wang, “Vehicle routing problem application in tour planning multimedia system with metaheuristic designed,” Advances in Information Sciences and Service Sciences, vol. 3, no. 2, pp. 1–11, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. X. Li, P. Tian, and S. C. H. Leung, “Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm,” International Journal of Production Economics, vol. 125, no. 1, pp. 137–145, 2010. View at Publisher · View at Google Scholar · View at Scopus
  3. H. Malekly, B. Haddadi, and T.-M. Reza, “A fuzzy random vehicle routing problem: the case of Iran,” in Proceedings of the International Conference on Computers and Industrial Engineering (CIE '09), pp. 1070–1075, Troyes, France, July 2009. View at Scopus
  4. P. Toth and D. Vigo, The Vehicle Routing Problem, SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, Pa, USA, 2002.
  5. B.-I. Kim, S. Kim, and S. Sahoo, “Waste collection vehicle routing problem with time windows,” Computers and Operations Research, vol. 33, no. 12, pp. 3624–3642, 2006. View at Publisher · View at Google Scholar · View at Scopus
  6. F. Semet and E. Taillard, “Solving real-life vehicle routing problems efficiently using tabu search,” Annals of Operations Research, vol. 41, no. 4, pp. 469–488, 1993. View at Publisher · View at Google Scholar · View at Scopus
  7. J. F. Cordeau and G. Laporte, “Tabu search heuristics for the vehicle routing problem,” Metaheuristic Optimization Via Memory and Evolution, vol. 30, pp. 145–163, 2005. View at Google Scholar
  8. N. S. Niazy and A. Badr, “Complexity of capacitated vehicles routing problem using cellular genetic algorithms,” International Journal of Computer Science and Network Security, vol. 12, no. 2, p. 5, 2012. View at Google Scholar
  9. E. F. Zulvia, R. J. Kuo, and T.-L. Hu, “Solving CVRP with time window, fuzzy travel time and demand via a hybrid ant colony optimization and genetic algorithm,” in Proceedings of the IEEE World Congress on Computational Intelligence (WCCI '2012), Brisbane, Australia.
  10. L. M. Gambardella, E. Taillard, and G. Agazzi, MACS-VRPTW: A Multiple Ant Colony System For Vehicle Routing Problems With Time Windows in New ideAs in optimization, 1999, Edited by D. Corne.
  11. J. E. Bell and P. R. McMullen, “Ant colony optimization techniques for the vehicle routing problem,” Advanced Engineering Informatics, vol. 18, no. 1, pp. 41–48, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. B.-B. Jiang, H.-M. Chen, L.-N. Ma, and L. Deng, “Time-dependent pheromones and electric-field model: a new ACO algorithm for dynamic traffic routing,” International Journal of Modelling, Identification and Control, vol. 12, no. 1-2, pp. 29–35, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. R. Zhou, H. P. Lee, and A. Y. C. Nee, “Applying Ant Colony Optimisation (ACO) algorithm to dynamic job shop scheduling problems,” International Journal of Manufacturing Research, vol. 3, no. 3, pp. 301–320, 2008. View at Publisher · View at Google Scholar · View at Scopus
  14. M. López-Ibáñez and C. Blum, “Beam-ACO for the travelling salesman problem with time windows,” Computers & Operations Research, vol. 37, no. 9, pp. 1570–1583, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. B. Jin and L. Zhang, “An improved ant colony algorithm for path optimization in emergency rescue,” in Proceedings of the 2nd International Workshop on Intelligent Systems and Applications (ISA '10), May 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. X. C. Bian, C. Zhu, and Y. X. He, “Application of path weights ant colony algorithm in emergency rescue,” Industrial Safety and Environmental Protection, vol. 36, no. 11, pp. 60–62, 2010. View at Google Scholar
  17. H. Wang and C. Cao, “Research on an intelligent ant algorithm in conjuction with local O3-opt optimization,” Computer Applications and Software, vol. 10, pp. 89–91, 2010. View at Google Scholar
  18. R. Kamil and S. Reiji, “Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem,” IEEE Conference Publications, pp. 489–495, 2012. View at Google Scholar
  19. N. Christofides, A. Mingozzi, and P. Toth, “The vehicle routing problem,” in Combinatorial Optimization, pp. 315–338, Wiley, Chichester, UK, 1979. View at Google Scholar
  20. P. Chen, H.-K. Huang, and X.-Y. Dong, “Hybrid heuristic algorithm for the vehicle routing problem with simultaneous delivery and pickup,” Chinese Journal of Computers, vol. 31, no. 4, pp. 565–573, 2008. View at Google Scholar · View at Scopus
  21. M. Y. Khoshbakht and M. Sedighpour, “An optimization algorithm for the capacitated vehicle routing problem based on ant colony system,” Australian Journal of Basic and Applied Sciences, vol. 5, no. 12, pp. 2729–2737, 2011. View at Google Scholar · View at Scopus
  22. B. Lyamine, H. Amir, and K. Abder, “A hybrid heuristic approach to solve the capacitated vehicle routing problem,” Journal of Artificial Intelligence, vol. 1, no. 1, p. 31, 2010. View at Google Scholar