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

A Hybrid GRASP+VND Heuristic for the Two-Echelon Vehicle Routing Problem Arising in City Logistics

School of Electronics and Information Engineering, Tongji University, Shanghai 201804, China

Received 29 November 2013; Accepted 30 March 2014; Published 23 April 2014

Academic Editor: Baozhen Yao

Copyright © 2014 Zheng-yang Zeng 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. E. Taniguchi and R. G. Thompson, “Modeling city logistics,” Transportation Research Record, vol. 1790, no. 1, pp. 45–51, 2002. View at Google Scholar · View at Scopus
  2. T. G. Crainic, N. Ricciardi, and G. Storchi, “Advanced freight transportation systems for congested urban areas,” Transportation Research C: Emerging Technologies, vol. 12, no. 2, pp. 119–137, 2004. View at Publisher · View at Google Scholar · View at Scopus
  3. T. G. Crainic, N. Ricciardi, and G. Storchi, “Models for evaluating and planning city logistics systems,” Transportation Science, vol. 43, no. 4, pp. 432–454, 2009. View at Publisher · View at Google Scholar · View at Scopus
  4. G. Perboli, R. Tadei, and D. Vigo, “The two-echelon capacitated vehicle routing problem: models and math-based heuristics,” Transportation Science, vol. 45, no. 3, pp. 364–380, 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. G. Perboli and R. Tadei, “New families of valid inequalities for the two-echelon vehicle routing problem,” Electronic Notes in Discrete Mathematics, vol. 36, pp. 639–646, 2010, Proceedings of the International Symposium on Combinatorial Optimization (ISCO '10). View at Publisher · View at Google Scholar · View at Scopus
  6. M. Jepsen, S. Spoorendonk, and S. Ropke, “A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem,” Transportation Science, vol. 47, no. 1, pp. 23–37, 2013. View at Google Scholar
  7. R. Baldacci, A. Mingozzi, R. Roberti, and R. W. Calvo, “An exact algorithm for the two-echelon capacitated vehicle routing problem,” Operations Research, vol. 61, no. 2, pp. 298–314, 2013. View at Google Scholar
  8. T. G. Crainic, S. Mancini, G. Perboli, and R. Tadei, “Multi-start heuristics for the two-echelon vehicle routing problem,” in Evolutionary Computation in Combinatorial Optimization, P. Merz and J. K. Hao, Eds., vol. 6622 of Lecture Notes in Computer Science, pp. 179–190, Springer, Berlin, Germany, 2011. View at Google Scholar
  9. W. Meihua, T. Xuhong, C. Shan, and W. Shumin, “Hybrid ant colony optimization algorithm for two echelon vehicle routing problem,” Procedia Engineering, vol. 15, pp. 3361–3365, 2011. View at Google Scholar
  10. V. C. Hemmelmayr, J. Cordeau, and T. G. Crainic, “An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics,” Computers and Operations Research, vol. 39, no. 12, pp. 3215–3228, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. T. G. Crainic, S. Mancini, G. Perboli, and R. Tadei, “Grasp with path relinking for the two-echelon vehicle routing problem,” in Advances in Metaheuristics, L. D. Gaspero, A. Schaerf, and T. Stutzle, Eds., vol. 53 of Operations Research/Computer Science Interfaces Series, pp. 113–125, Springer, New York, NY, USA, 2013. View at Google Scholar
  12. T. A. Feo and M. G. C. Resende, “Greedy randomized adaptive search procedures,” Journal of Global Optimization, vol. 6, no. 2, pp. 109–133, 1995. View at Publisher · View at Google Scholar · View at Scopus
  13. M. G. Resende and C. C. Ribeiro, “Greedy randomized adaptive search procedures: advances, hybridizations, and applications,” in Handbook of Metaheuristics, M. Gendreau and J. Y. Potvin, Eds., vol. 146 of International Series in Operations Research & Management Science, pp. 283–319, Springer US, New York, NY, USA, 2nd edition, 2010. View at Google Scholar
  14. N. Mladenović and P. Hansen, “Variable neighborhood search,” Computers and Operations Research, vol. 24, no. 11, pp. 1097–1100, 1997. View at Google Scholar · View at Scopus
  15. P. Hansen, N. Mladenovic, J. Brimberg, and J. Perez, “Variable neighborhood search,” in Handbook of Metaheuristics, M. Gendreau and J. Y. Potvin, Eds., pp. 61–86, Springer US, New York, NY, USA, 2nd edition, 2010. View at Google Scholar
  16. H. Hernández-Pérez, I. Rodríguez-Martín, and J. J. Salazar-González, “A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem,” Computers and Operations Research, vol. 36, no. 5, pp. 1639–1645, 2009. View at Publisher · View at Google Scholar · View at Scopus
  17. J. G. Villegas, C. Prins, C. Prodhon, A. L. Medaglia, and N. Velasco, “GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots,” Engineering Applications of Artificial Intelligence, vol. 23, no. 5, pp. 780–794, 2010. View at Publisher · View at Google Scholar · View at Scopus
  18. A. Salehipour, K. Sörensen, P. Goos, and O. Bräysy, “Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem,” 4OR, vol. 9, no. 2, pp. 189–209, 2011. View at Publisher · View at Google Scholar · View at Scopus
  19. F. Parreño, R. Alvarez-Valdes, J. F. Oliveira, and J. M. Tamarit, “A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing,” Annals of Operations Research, vol. 179, no. 1, pp. 203–220, 2010. View at Publisher · View at Google Scholar · View at Scopus
  20. P. Schittekat, J. Kinable, K. Sorensen, M. Sevaux, F. Spieksma, and J. Springael, “A metaheuristic for the school bus routing problem with bus stop selection,” The European Journal of Operational Research, vol. 229, no. 2, pp. 518–528, 2013. View at Google Scholar
  21. V. Nguyen, C. Prins, and C. Prodhon, “Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking,” The European Journal of Operational Research, vol. 216, no. 1, pp. 113–126, 2012. View at Publisher · View at Google Scholar · View at Scopus
  22. C. Archetti, M. G. Speranza, and A. Hertz, “A tabu search algorithm for the split delivery vehicle routing problem,” Transportation Science, vol. 40, no. 1, pp. 64–73, 2006. View at Publisher · View at Google Scholar · View at Scopus
  23. G. Clarke and J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points,” Operations Research, vol. 12, no. 4, pp. 568–581, 1964. View at Google Scholar
  24. J. Beasley, “Route first-Cluster second methods for vehicle routing,” Omega, vol. 11, no. 4, pp. 403–408, 1983. View at Google Scholar · View at Scopus
  25. C. Prins, “A simple and effective evolutionary algorithm for the vehicle routing problem,” Computers and Operations Research, vol. 31, no. 12, pp. 1985–2002, 2004. View at Publisher · View at Google Scholar · View at Scopus
  26. A. Subramanian, L. M. A. Drummond, C. Bentes, L. S. Ochi, and R. Farias, “A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery,” Computers and Operations Research, vol. 37, no. 11, pp. 1899–1911, 2010. View at Publisher · View at Google Scholar · View at Scopus
  27. A. Subramanian, P. H. V. Penna, E. Uchoa, and L. S. Ochi, “A hybrid algorithm for the heterogeneous fleet vehicle routing problem,” The European Journal of Operational Research, vol. 221, no. 2, pp. 285–295, 2012. View at Publisher · View at Google Scholar · View at Scopus
  28. A. Subramanian, P. H. V. Penna, E. Uchoa, and L. S. Ochi, “A hybrid algorithm for a class of vehicle routing problems,” The European Journal of Operational Research, vol. 40, no. 10, pp. 2519–2531, 2013. View at Publisher · View at Google Scholar · View at Scopus
  29. J. Potvin and J. Rousseau, “Exchange heuristic for routeing problems with time windows,” Journal of the Operational Research Society, vol. 46, no. 12, pp. 1433–1446, 1995. View at Google Scholar · View at Scopus
  30. O. Bräysy and M. Gendreau, “Vehicle routing problem with time windows, part I: route construction and local search algorithms,” Transportation Science, vol. 39, no. 1, pp. 104–118, 2005. View at Publisher · View at Google Scholar · View at Scopus
  31. V. P. Nguyen, C. Prins, and C. Prodhon, “A multi-start evolutionary local search for the two-echelon location routing problem,” in Hybrid Metaheuristics, M. J. Blesa, C. Blum, G. Raidl, A. Roli, and M. Sampels, Eds., vol. 6373 of Lecture Notes in Computer Science, pp. 88–102, Springer, Berlin, Germany, 2010. View at Google Scholar
  32. P. Chen, H. Huang, and X. Dong, “Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem,” Expert Systems with Applications, vol. 37, no. 2, pp. 1620–1627, 2010. View at Publisher · View at Google Scholar · View at Scopus
  33. T. G. Crainic, G. Perboli, S. Mancini, and R. Tadei, “Two-echelon vehicle routing problem: a satellite location analysis,” Procedia—Social and Behavioral Sciences, vol. 2, no. 3, pp. 5944–5955, 2010, Proceedings of the 6th International Conference on City Logistics. View at Google Scholar