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

A Framing Link Based Tabu Search Algorithm for Large-Scale Multidepot Vehicle Routing Problems

1College of Management and Economics, Tianjin University, Tianjin 300072, China
2Department of Production and Quality Engineering, Norwegian University of Science and Technology, 7491 Trondheim, Norway
3School of Management, Hebei University of Technology, Tianjin 300401, China

Received 21 April 2014; Accepted 29 June 2014; Published 23 July 2014

Academic Editor: Baozhen Yao

Copyright © 2014 Xuhao Zhang 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. C. A. Ullrich, “Integrated machine scheduling and vehicle routing with time windows,” European Journal of Operational Research, vol. 227, no. 1, pp. 152–165, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. M. S. Rasmussen, T. Justesen, A. Dohn, and J. Larsen, “The home care crew scheduling problem: preference-based visit clustering and temporal dependencies,” European Journal of Operational Research, vol. 219, no. 3, pp. 598–610, 2012. View at Publisher · View at Google Scholar · View at Scopus
  3. J. Wilck and T. Cavalier, “A genetic algorithm for the split delivery vehicle routing problem,” Physics & Mathematics, vol. 2, pp. 207–216, 2012. View at Google Scholar
  4. J. Riera-Ledesma and J. Salazar-González, “Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach,” Computers and Operations Research, vol. 39, no. 2, pp. 391–404, 2012. View at Publisher · View at Google Scholar · View at Scopus
  5. A. Lim, B. Rodrigues, and Z. Xu, “Transportation procurement with seasonally varying shipper demand and volume guarantees,” Operations Research, vol. 56, no. 3, pp. 758–771, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  6. R. Agarwal and Ö. Ergun, “Ship scheduling and network design for cargo routing in liner shipping,” Transportation Science, vol. 42, no. 2, pp. 175–196, 2008. View at Publisher · View at Google Scholar · View at Scopus
  7. B. 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 Zentralblatt MATH · View at Scopus
  8. S. S. Syam, “A multiple server location-allocation model for service system design,” Computers & Operations Research, vol. 35, no. 7, pp. 2248–2265, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. J. F. Campbell, A. T. Ernst, and M. Krishnamoorthy, “Hub arc location problems: part I: introduction and results,” Management Science, vol. 51, no. 10, pp. 1540–1555, 2005. View at Publisher · View at Google Scholar · View at Scopus
  10. J. K. Lenstra and A. H. G. Rinnooy Kan, “Complexity of vehicle routing and scheduling problem,” Networks, vol. 11, no. 2, pp. 221–227, 1981. View at Publisher · View at Google Scholar · View at Scopus
  11. R. Hassin and S. Rubinstein, “On the complexity of the k-customer vehicle routing problem,” Operations Research Letters, vol. 33, no. 1, pp. 71–76, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. A. Imai, E. Nishimura, and J. Current, “A Lagrangian relaxation-based heuristic for the vehicle routing with full container load,” European Journal of Operational Research, vol. 176, no. 1, pp. 87–105, 2007. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. M. M. Solomon, “On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints,” Networks, vol. 16, no. 2, pp. 161–174, 1986. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. H. Hashimoto, T. Ibaraki, S. Imahori, and M. Yagiura, “The vehicle routing problem with flexible time windows and traveling times,” Discrete Applied Mathematics. The Journal of Combinatorial Algorithms, Informatics and Computational Sciences, vol. 154, no. 16, pp. 2271–2290, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  15. M. W. P. Savelsbergh, “Local search in routing problems with time windows,” Annals of Operations Research, vol. 4, no. 1–4, pp. 285–305, 1985. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. B. E. Gillett and J. G. Johnson, “Multi-terminal vehicle-dispatch algorithm,” Omega, vol. 4, no. 6, pp. 711–718, 1976. View at Publisher · View at Google Scholar · View at Scopus
  17. B. Golden, T. Magnanti, and H. Nguyen, “Implementing vehicle routing algorithms,” Networks, vol. 7, pp. 113–148, 1977. View at Google Scholar
  18. S. Salhi and M. Sari, “A multi-level composite heuristic for the multi-depot vehicle fleet mix problem,” European Journal of Operational Research, vol. 103, no. 1, pp. 95–112, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  19. R. T. Sumichras and I. S. Markham, “A heuristic and lower bound for a multi-depot routing problem,” Computers & Operations Research, vol. 22, no. 10, pp. 1047–1056, 1995. View at Publisher · View at Google Scholar · View at Scopus
  20. M. Wasner and G. Zäpfel, “An integrated multi-depot hub-location vehicle routing model for network planning of parcel service,” International Journal of Production Economics, vol. 90, no. 3, pp. 403–419, 2004. View at Publisher · View at Google Scholar · View at Scopus
  21. G. Nagy and S. Salhi, “Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries,” European Journal of Operational Research, vol. 162, no. 1, pp. 126–141, 2005. View at Publisher · View at Google Scholar · View at Scopus
  22. A. Lim and F. Wang, “Multi-depot vehicle routing problem: a one-stage approach,” IEEE Transactions on Automation Science and Engineering, vol. 2, no. 4, pp. 397–402, 2005. View at Publisher · View at Google Scholar · View at Scopus
  23. M. Mirabi, S. M. T. F. Ghomi, and F. Jolai, “Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem,” Robotics and Computer-Integrated Manufacturing, vol. 26, no. 6, pp. 564–569, 2010. View at Publisher · View at Google Scholar · View at Scopus
  24. C. Contardo and R. Martinelli, “A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints,” Discrete Optimization, vol. 12, pp. 129–146, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  25. J. Cordeau, M. Gendreau, and G. Laporte, “A tabu search heuristic for periodic and multi-depot vehicle routing problems,” Networks, vol. 30, no. 2, pp. 105–119, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  26. J. Cordeau, G. Laporte, and A. Mercier, “A unified tabu search heuristic for vehicle routing problems with time windows,” Journal of the Operational Research Society, vol. 52, no. 8, pp. 928–936, 2001. View at Publisher · View at Google Scholar · View at Scopus
  27. J. Renaud, G. Laporte, and F. F. Boctor, “A tabu search heuristic for the multi-depot vehicle routing problem,” Computers and Operations Research, vol. 23, no. 3, pp. 229–235, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  28. B. Crevier, J. Cordeau, and G. Laporte, “The multi-depot vehicle routing problem with inter-depot routes,” European Journal of Operational Research, vol. 176, no. 2, pp. 756–773, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  29. S. Belhaiza, P. Hansen, and G. Laporte, “A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows,” in Proceedings of the International Conference on Industrial Engineering and Systems Management (IESM '11), Metz, France, 2011.
  30. S. Bae, H. S. Hwang, G. Cho, and M. Goan, “Integrated GA-VRP solver for multi-depot system,” Computers and Industrial Engineering, vol. 53, no. 2, pp. 233–240, 2007. View at Publisher · View at Google Scholar · View at Scopus
  31. W. Ho, G. T. S. Ho, P. Ji, and H. C. W. Lau, “A hybrid genetic algorithm for the multi-depot vehicle routing problem,” Engineering Applications of Artificial Intelligence, vol. 21, no. 4, pp. 548–557, 2008. View at Publisher · View at Google Scholar · View at Scopus
  32. X. Wang, C. Xu, and H. Shang, “Multi-depot vehicle routing problem with time windows and multi-type vehicle number limits and its genetic algorithm,” in Proceedings of the International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM '08), pp. 1–5, Dalian, China, October 2008. View at Publisher · View at Google Scholar · View at Scopus
  33. Y. Li and X. Liu, “Modelling and its ant colony algorithm for multi-depot open vehicle routing problem with replenishment on the way,” Computer Integrated Manufacturing Systems, vol. 14, no. 3, pp. 557–562, 2008. View at Google Scholar · View at Scopus
  34. T. Wu, C. Low, and J. Bai, “Heuristic solutions to multi-depot location-routing problems,” Computers and Operations Research, vol. 29, no. 10, pp. 1393–1415, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  35. S. Chen, A. Imai, and B. Zhao, “A SA-based heuristic for the multi-depot vehicle routing problem,” Journal of Japan Institute of Navigation, vol. 113, pp. 209–216, 2005. View at Google Scholar
  36. C. D. Tarantilis and C. T. Kiranoudis, “BoneRoute: an adaptive memory-based method for effective fleet management,” Annals of Operations Research, vol. 115, pp. 227–241, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  37. S. Zhong, “Open vehicle routing problem based on kernel route tabu search algorithm,” Computer Integrated Manufacturing Systems, vol. 13, no. 4, pp. 827–832, 2007. View at Google Scholar · View at Scopus
  38. M. M. Solomon, “Algorithms for the vehicle routing and scheduling problems with time window constraints,” Operations Research, vol. 35, no. 2, pp. 254–265, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  39. I. Chao, B. Golden, and E. Wasil, “A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions,” American Journal of Mathematical and Management Sciences, vol. 13, pp. 371–406, 1993. View at Google Scholar