Towards Fast and Accurate Solutions to Vehicle Routing in a Large-Scale and Dynamic Environment

  • Yaguang LiEmail author
  • Dingxiong Deng
  • Ugur Demiryurek
  • Cyrus Shahabi
  • Siva Ravada
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9239)


The delivery and courier services are entering a period of rapid change due to the recent technological advancements, E-commerce competition and crowdsourcing business models. These revolutions impose new challenges to the well studied vehicle routing problem by demanding (a) more ad-hoc and near real time computation - as opposed to nightly batch jobs - of delivery routes for large number of delivery locations, and (b) the ability to deal with the dynamism due to the changing traffic conditions on road networks. In this paper, we study the Time-Dependent Vehicle Routing Problem (TDVRP) that enables both efficient and accurate solutions for large number of delivery locations on real world road network. Previous Operation Research (OR) approaches are not suitable to address the aforementioned new challenges in delivery business because they all rely on a time-consuming a priori data-preparation phase (i.e., the computation of a cost matrix between every pair of delivery locations at each time interval). Instead, we propose a spatial-search-based framework that utilizes an on-the-fly shortest path computation eliminating the OR data-preparation phase. To further improve the efficiency, we adaptively choose the more promising delivery locations and operators to reduce unnecessary search of the solution space. Our experiments with real road networks and real traffic data and delivery locations show that our algorithm can solve a TDVRP instance with 1000 delivery locations within 20 min, which is 8 times faster than the state-of-the-art approach, while achieving similar accuracy.


Local Search Road Network Travel Cost Vehicle Rout Problem Delivery Location 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



This research has been funded in part by NSF grants IIS-1115153 and IIS-1320149, the USC Integrated Media Systems Center (IMSC), METRANS Transportation Center under grants from Caltrans, and unrestricted cash gifts from Oracle. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of any of the sponsors such as the National Science Foundation.


  1. 1.
    Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5), 512–522 (2002)zbMATHCrossRefGoogle Scholar
  2. 2.
    The Wall Street Journal: At UPS, the algorithm is the driver (2015).
  3. 3.
  4. 4.
    Demiryurek, U., Banaei-Kashani, F., Shahabi, C., Ranganathan, A.: Online computation of fastest path in time-dependent spatial networks. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 92–111. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  5. 5.
    Malandraki, C., Daskin, M.S.: Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp. Sci. 26(3), 185–200 (1992)zbMATHCrossRefGoogle Scholar
  6. 6.
    Hashimoto, H., Yagiura, M., Ibaraki, T.: An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optim. 5(2), 434–456 (2008)zbMATHMathSciNetCrossRefGoogle Scholar
  7. 7.
    Li, F., Golden, B., Wasil, E.: Very large-scale vehicle routing: new test problems, algorithms, and results. Comput. Oper. Res. 32(5), 1165–1179 (2005)zbMATHCrossRefGoogle Scholar
  8. 8.
    Groer, C.: Parallel and serial algorithms for vehicle routing problems. ProQuest (2008)Google Scholar
  9. 9.
    Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)CrossRefGoogle Scholar
  10. 10.
    Demiryurek, U., Banaei-Kashani, F., Shahabi, C.: Efficient K-nearest neighbor search in time-dependent spatial networks. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part I. LNCS, vol. 6261, pp. 432–449. Springer, Heidelberg (2010) CrossRefGoogle Scholar
  11. 11.
    Laporte, G., Gendreau, M., Potvin, J.Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7(4–5), 285–300 (2000)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M.: The vehicle routing problem with time windows part I: tabu search. INFORMS J. Comput. 8(2), 158–164 (1996)zbMATHCrossRefGoogle Scholar
  13. 13.
    Baldacci, R., Hadjiconstantinou, E., Mingozzi, A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52(5), 723–738 (2004)zbMATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2), 340–349 (1974)zbMATHCrossRefGoogle Scholar
  15. 15.
    Longo, H., de Aragão, M.P., Uchoa, E.: Solving capacitated arc routing problems using a transformation to the CVRP. Comput. Oper. Res. 33(6), 1823–1837 (2006)zbMATHCrossRefGoogle Scholar
  16. 16.
    Letchford, A.N., Nasiri, S.D., Oukil, A.: Pricing routines for vehicle routing with time windows on road networks. Comput. Oper. Res. 51, 331–337 (2014)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Ichoua, S., Gendreau, M., Potvin, J.Y.: Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144, 379–396 (2003)zbMATHCrossRefGoogle Scholar
  18. 18.
    Kok, A., Hans, E., Schutten, J.: Vehicle routing under time-dependent travel times: the impact of congestion avoidance. Comput. Oper. Res. 39(5), 910–918 (2012)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Yaguang Li
    • 1
    Email author
  • Dingxiong Deng
    • 1
  • Ugur Demiryurek
    • 1
  • Cyrus Shahabi
    • 1
  • Siva Ravada
    • 2
  1. 1.Department of Computer ScienceUniversity of Southern CaliforniaLos AngelesCalifornia
  2. 2.OracleUSA

Personalised recommendations