Skip to main content
SpringerLink
Log in

Dynamic routing with real-time traffic information

  • Original Paper
  • Published:
Operational Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Adelman D (2007) Price-directed control of a closed logistics queueing network. Oper. Res. 55(6):1022–1038

    Article  Google Scholar 

  • Adelman D, Klabjan D (2012) Computing near-optimal policies in generalized joint replenishment. INFORMS J Comput 24(1):148–164

    Article  Google Scholar 

  • 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–216

    Article  Google Scholar 

  • Bell MG (2006) Mixed route strategies for the risk-averse shipment of hazardous materials. Netw Spat Econ 6(3–4):253–265

    Article  Google Scholar 

  • 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–282

    Article  Google Scholar 

  • 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–396

    Article  Google Scholar 

  • Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag sci 6(1):80–91

    Article  Google Scholar 

  • 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–34

    Article  Google Scholar 

  • 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–66

    Article  Google Scholar 

  • Fu L (2002) Scheduling dial-a-ride paratransit under time-varying, stochastic congestion. Transp Res Part B Methodol 36(6):485–506

    Article  Google Scholar 

  • 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–790

    Article  Google Scholar 

  • 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–272

    Article  Google Scholar 

  • Goberna MA, López MA (1998) Linear semi-infinite optimization. Wiley, Chichester, England

    Google Scholar 

  • Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin

    Book  Google Scholar 

  • 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–390

    Article  Google Scholar 

  • Jaillet P, Qi J, Sim M (2016) Routing optimization under uncertainty. Oper Res 64(1):186–200

    Article  Google Scholar 

  • Kang Y, Batta R, Kwon C (2014) Value-at-risk model for hazardous material transportation. Ann Oper Res 222(1):361–387

    Article  Google Scholar 

  • 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–454

    Article  Google Scholar 

  • Lambert V, Laporte G, Louveaux F (1993) Designing collection routes through bank branches. Comput Oper Res 20(7):783–791

    Article  Google Scholar 

  • Laporte G (2007) What you should know about the vehicle routing problem. Nav Res Logist (NRL) 54(8):811–819

    Article  Google Scholar 

  • Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408–416

    Article  Google Scholar 

  • Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. Eur J Oper Res 59(3):345–358

    Article  Google Scholar 

  • Laporte G, Louveaux F, Mercure H (1992) The vehicle routing problem with stochastic travel times. Transp Sci 26(3):161–170

    Article  Google Scholar 

  • 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–118

    Article  Google Scholar 

  • 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–145

    Article  Google Scholar 

  • 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–414

    Article  Google Scholar 

  • 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–515

    Article  Google Scholar 

  • Powell WB (2009) Approximate dynamic programming: solving the curses of dimensionality. 2nd edn, Wiley Series in Probability and Statistics, New Jersey

  • Pillac V, Gendreau M, Guéret C, Medaglia AL (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1–11

    Article  Google Scholar 

  • 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–154

    Article  Google Scholar 

  • Psaraftis HN (1995) Dynamic vehicle routing: status and prospects. Ann Oper Res 61(1):143–164

    Article  Google Scholar 

  • Ritzinger U, Puchinger J, Hartl RF (2015) A survey on dynamic and stochastic vehicle routing problems. Int J Product Res 54(1):1–17

    Google Scholar 

  • Sebő A (2013) Eight-fifth approximation for the path tsp. In: Integer programming and combinatorial optimization. Springer, pp 362–374

  • Secomandi N (2001) A rollout policy for the vehicle routing problem with stochastic demands. Oper Res 49(5):796–802

    Article  Google Scholar 

  • Shapiro A, Dentcheva D et al (2014) Lectures on stochastic programming: modeling and theory, vol 16. SIAM

  • Sun L, Karwan MH, Kwon C (2015) Robust hazmat network design problems considering risk uncertainty. Transp Sci 50(4):1188–1203

    Article  Google Scholar 

  • 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–205

    Article  Google Scholar 

  • Topaloglu H, Powell WB (2006) Dynamic-programming approximations for stochastic time-staged integer multicommodity-flow problems. INFORMS J Comput 18(1):31–42

    Article  Google Scholar 

  • Topaloglu H, Powell WB (2007) Sensitivity analysis of a dynamic fleet management model using approximate dynamic programming. Oper Res 55(2):319–331

    Article  Google Scholar 

  • Toriello A (2014) Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem. Math Program 144(1–2):247–264

    Article  Google Scholar 

  • Toriello A, Haskell WB, Poremba M (2014) A dynamic traveling salesman problem with stochastic arc costs. Oper Res 62(5):1107–1125

    Article  Google Scholar 

  • 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–92

    Article  Google Scholar 

  • Toumazis I, Kwon C (2015) Worst-case conditional value-at-risk minimization for hazardous materials transportation. Transp Sci 50(4):1174–1187

    Article  Google Scholar 

  • Xiao L, Lo HK (2013) Adaptive vehicle routing for risk-averse travelers. Transp Res Part C Emerg Technol 36:460–479

    Article  Google Scholar 

  • 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–1094

    Article  Google Scholar 

Download references

Acknowledgements

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

Author information

Authors and Affiliations

  1. State Key Laboratory of Mechanical Transmission, Chongqing University, Chongqing, China

    Guodong Yu & Yu Yang

Authors
  1. Guodong Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu Yang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yu, G., Yang, Y. Dynamic routing with real-time traffic information. Oper Res Int J 19, 1033–1058 (2019). https://doi.org/10.1007/s12351-017-0314-9

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12351-017-0314-9

Keywords

Search

Navigation