Advertisement

Operational Research

, Volume 19, Issue 4, pp 1033–1058 | Cite as

Dynamic routing with real-time traffic information

  • Guodong Yu
  • Yu YangEmail author
Original Paper

Abstract

We consider the vehicle routing problem (VRP) with real-time traffic information, where stochastic intermediate times (travel times and service times) are assumed to be realized with probability distributions at the end of each customer’s service and before determining the next customer to visit. We propose a dynamic VRP (DVRP) model addressing the varying intermediate times and show that the DVRP can significantly reduce the total duration than the static or priori VRP model. To solve the DVRP model, we develop an approximate dynamic programming algorithm based on a semi-infinite linear programming, which can be derived from a class of affine time-to-go approximation functions and generate lower bound only dependent on the expected duration and the description of support set of the stochastic time vectors. We also propose a greedy heuristic time-directed policy to produce good solutions and improve computational efficiency even for the worst-case condition, and prove that it can be solved within polynomial time. The results show that our approach is of high applicability for the VRP with dynamic and real-time traffic.

Keywords

Dynamic VRP Stochastic intermediate times Dynamic programming Approximation Greedy heuristic 

Notes

Acknowledgements

This research is supported by the the National Natural Science Foundation of China (No. 71571023).

References

  1. Adelman D (2007) Price-directed control of a closed logistics queueing network. Oper. Res. 55(6):1022–1038CrossRefGoogle Scholar
  2. Adelman D, Klabjan D (2012) Computing near-optimal policies in generalized joint replenishment. INFORMS J Comput 24(1):148–164CrossRefGoogle Scholar
  3. An S, Cui N, Bai Y, Xie W, Chen M, Ouyang Y (2015) Reliable emergency service facility location under facility disruption, en-route congestion and in-facility queuing. Transp Res Part E Logist Transp Rev 82:199–216CrossRefGoogle Scholar
  4. Bell MG (2006) Mixed route strategies for the risk-averse shipment of hazardous materials. Netw Spat Econ 6(3–4):253–265CrossRefGoogle Scholar
  5. Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math program 20(1):255–282CrossRefGoogle Scholar
  6. Dabia S, Ropke S, Van Woensel T, De Kok T (2013) Branch and price for the time-dependent vehicle routing problem with time windows. Transp Sci 47(3):380–396CrossRefGoogle Scholar
  7. Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag sci 6(1):80–91CrossRefGoogle Scholar
  8. Dixit VV, Harb RC, Martínez-Correa J, Rutström EE (2015) Measuring risk aversion to guide transportation policy: contexts, incentives, and respondents. Transp Res Part A Policy Pract 80:15–34CrossRefGoogle Scholar
  9. Errico F, Desaulniers G, Gendreau M, Rei W, Rousseau LM (2016) A priori optimization with recourse for the vehicle routing problem with hard time windows and stochastic service times. Eur J Oper Res 249(1):55–66CrossRefGoogle Scholar
  10. Fu L (2002) Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transp Res Part B Methodol 36(6):485–506CrossRefGoogle Scholar
  11. Ghannadpour SF, Noori S, Tavakkoli-Moghaddam R (2013) Multiobjective dynamic vehicle routing problem with fuzzy travel times and customers satisfaction in supply chain management. Eng Manag IEEE Trans 60(4):777–790CrossRefGoogle Scholar
  12. Gheorghe AV, Birchmeier J, Vamanu D, Papazoglou I, Kröger W (2005) Comprehensive risk assessment for rail transportation of dangerous goods: a validated platform for decision support. Reliab Eng Syst Saf 88(3):247–272CrossRefGoogle Scholar
  13. Goberna MA, López MA (1998) Linear semi-infinite optimization. Wiley, Chichester, EnglandGoogle Scholar
  14. Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, BerlinCrossRefGoogle Scholar
  15. Han J, Lee C, Park S (2013) A robust scenario approach for the vehicle routing problem with uncertain travel times. Transp Sci 48(3):373–390CrossRefGoogle Scholar
  16. Jaillet P, Qi J, Sim M (2016) Routing optimization under uncertainty. Oper Res 64(1):186–200CrossRefGoogle Scholar
  17. Kang Y, Batta R, Kwon C (2014) Value-at-risk model for hazardous material transportation. Ann Oper Res 222(1):361–387CrossRefGoogle Scholar
  18. Kok AL, Meyer CM, Kopfer H, Schutten JMJ (2010) A dynamic programming heuristic for the vehicle routing problem with time windows and european community social legislation. Transp Sci 44(4):442–454CrossRefGoogle Scholar
  19. Lambert V, Laporte G, Louveaux F (1993) Designing collection routes through bank branches. Comput Oper Res 20(7):783–791CrossRefGoogle Scholar
  20. Laporte G (2007) What you should know about the vehicle routing problem. Nav Res Logist (NRL) 54(8):811–819CrossRefGoogle Scholar
  21. Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408–416CrossRefGoogle Scholar
  22. Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345–358CrossRefGoogle Scholar
  23. Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transp Sci 26(3):161–170CrossRefGoogle Scholar
  24. Lei H, Laporte G, Guo B (2012) A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times. Top 20(1):99–118CrossRefGoogle Scholar
  25. Li X, Tian P, Leung SC (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Product Econ 125(1):137–145CrossRefGoogle Scholar
  26. Nguyen V, Jiang J, Ng K, Teo K (2016) Satisficing measure approach for vehicle routing problem with time windows under uncertainty. Eur J Oper Res 248(2):404–414CrossRefGoogle Scholar
  27. Novoa C, Storer R (2009) An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. Eur J Oper Res 196(2):509–515CrossRefGoogle Scholar
  28. Powell WB (2009) Approximate dynamic programming: solving the curses of dimensionality. 2nd edn, Wiley Series in Probability and Statistics, New JerseyGoogle Scholar
  29. Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11CrossRefGoogle Scholar
  30. Psaraftis HN (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14(2):130–154CrossRefGoogle Scholar
  31. Psaraftis HN (1995) Dynamic vehicle routing: status and prospects. Ann Oper Res 61(1):143–164CrossRefGoogle Scholar
  32. Ritzinger U, Puchinger J, Hartl RF (2015) A survey on dynamic and stochastic vehicle routing problems. Int J Product Res 54(1):1–17Google Scholar
  33. Sebő A (2013) Eight-fifth approximation for the path tsp. In: Integer programming and combinatorial optimization. Springer, pp 362–374Google Scholar
  34. Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper Res 49(5):796–802CrossRefGoogle Scholar
  35. Shapiro A, Dentcheva D et al (2014) Lectures on stochastic programming: modeling and theory, vol 16. SIAMGoogle Scholar
  36. Sun L, Karwan MH, Kwon C (2015) Robust hazmat network design problems considering risk uncertainty. Transp Sci 50(4):1188–1203CrossRefGoogle Scholar
  37. Sungur I, Ren Y, Ordóñez F, Dessouky M, Zhong H (2010) A model and algorithm for the courier delivery problem with uncertainty. Transp Sci 44(2):193–205CrossRefGoogle Scholar
  38. Topaloglu H, Powell WB (2006) Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS J Comput 18(1):31–42CrossRefGoogle Scholar
  39. Topaloglu H, Powell WB (2007) Sensitivity analysis of a dynamic fleet management model using approximate dynamic programming. Oper Res 55(2):319–331CrossRefGoogle Scholar
  40. Toriello A (2014) Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem. Math Program 144(1–2):247–264CrossRefGoogle Scholar
  41. Toriello A, Haskell WB, Poremba M (2014) A dynamic traveling salesman problem with stochastic arc costs. Oper Res 62(5):1107–1125CrossRefGoogle Scholar
  42. Toumazis I, Kwon C (2013) Routing hazardous materials on time-dependent networks using conditional value-at-risk. Transp Res Part C Emerg Technol 37:73–92CrossRefGoogle Scholar
  43. Toumazis I, Kwon C (2015) Worst-case conditional value-at-risk minimization for hazardous materials transportation. Transp Sci 50(4):1174–1187CrossRefGoogle Scholar
  44. Xiao L, Lo HK (2013) Adaptive vehicle routing for risk-averse travelers. Transp Res Part C Emerg Technol 36:460–479CrossRefGoogle Scholar
  45. Zhao H, Zhang C, Gao Z, Si B (2013) Risk-based transit schedule design for a fixed route from the view of equity. J Transp Eng 139(11):1086–1094CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2017

Authors and Affiliations

  1. 1.State Key Laboratory of Mechanical TransmissionChongqing UniversityChongqingChina

Personalised recommendations