Skip to main content

An Approach to Assess the Impact of Dynamic Congestion in Vehicle Routing Problems

  • Chapter
  • First Online:
Advances in Dynamic Network Modeling in Complex Transportation Systems

Part of the book series: Complex Networks and Dynamic Systems ((CNDS,volume 2))

Abstract

This research proposes an integrated framework of capacitated vehicle routing problems (CVRP) and traffic flow model (cell transmission model in this research) to assess the effect of time-varying congestion. We develop a framework consisting sequence of mixed integer programs solving the CVRP with updated cost obtained from the traffic flow model. A real-world network with 15 cities and towns is tested with the framework and results show significant travel time reduction from the case where time-varying congestion is not considered. In addition, we consider system optimal type of route choice behavior within the traffic flow model.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  • Ahuja RK, Magnanti TL, Orlin JB. Network flows: theory, algorithms and applications. Englewood Cliffs, NJ: Prentice Hall; 1993.

    Google Scholar 

  • Augerat P, Belenguer JM, Benavent E, Corberan A, Naddef D, Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. In: Grenoble editor. France: Institut d’informatique et de mathématiques appliquées de Grenoble; 1995. p. 30.

    Google Scholar 

  • Chang M-S, Hsueh C-F, Chen S-R. Real-time vehicle routing problem with time windows and simultaneous delivery/pickup demands. J Eastern Asia Soc Transport Stud. 2003;5:2273–2286.

    Google Scholar 

  • Chen H-K, Hsueh C-F, Chang M-S. The real-time time-dependent vehicle routing problem. Transport Res E Logist Transport Rev. 2006;42:383–408.

    Article  Google Scholar 

  • Conrad R, Figliozzi M. Algorithms to quantify impact of congestion on time-dependent real-world urban freight distribution networks. Transport Res Rec J Transport Res Board 2168, Washington, D.C.: Transportation Research Board of the National Academies; 2010, p. 104–113.

    Google Scholar 

  • Cordeau JF, Laporte G, Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc. 2001;52:928–936.

    Article  Google Scholar 

  • Daganzo CF. The cell transmission model, part II: network traffic. Transport Res B Methodological 1995;29:79–93.

    Article  Google Scholar 

  • Daganzo CF. The cell transmission model: A dynamic representation of highway traffic consistent with the hydrodynamic theory. Transport Res B Methodological 1994;28:269–287.

    Article  Google Scholar 

  • Dantzig GB, Ramser JH. The truck dispatching problem. Manag Sci. 1959;6:80–91.

    Article  Google Scholar 

  • Donati AV, Montemanni R, Casagrande N, Rizzoli AE, Gambardella LM. Time dependent vehicle routing problem with a multi ant colony system. Eur J Oper Res. 2008;185:1174–1191.

    Article  Google Scholar 

  • Figliozzi MA. Analysis of the efficiency of urban commercial vehicle tours: Data collection, methodology, and policy implications. Transport Res B Methodological 2007;41:1014–1032.

    Article  Google Scholar 

  • Fleischmann B, Gietz M, Gnutzmann S. Time-varying travel times in vehicle routing. Transport Sci. 2004;38:160–173.

    Article  Google Scholar 

  • Fukasawa R, Longo H, Lysgaard J, Aragão MP, d Reis M, Uchoa E, Werneck RF. Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program. 2006;106:491–511.

    Google Scholar 

  • Haghani A, Jung S. A dynamic vehicle routing problem with time-dependent travel times. Comput Oper Res. 2005;32:2959–2986.

    Article  Google Scholar 

  • Hu T-Y, Liao T-Y, Lu Y-C. Study of solution approach for dynamic vehicle routing problems with real-time information. Transport Res Rec J Transport Res Board 1857, Transportation Research Board of the National Academies, Washington, D.C., 2003, pp. 102–108.

    Google Scholar 

  • Ichoua S, Gendreau M, Potvin J-Y. Vehicle dispatching with time-dependent travel times. Eur J Oper Res. 2003;144:379–396.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Larsen A. The dynamic vehicle routing problem. PhD dissertation, Department of Mathematical Modeling, Technical University of Denmark, 2000.

    Google Scholar 

  • Lighthill MJ, Whitham GB. On kinematic waves II: A theory of traffic flow on long crowded roads. In Proceedings of the royal society of london series a-mathematical and physical sciences, 1955, p. 317–345.

    Google Scholar 

  • Lysgaard J, Letchford AN, Eglese RW. A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program. 2004;100:423–445.

    Article  Google Scholar 

  • Malandraki C, Daskin MS. Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transport Sci. 1992;26:185–200.

    Article  Google Scholar 

  • Malandraki C, Dial RB. A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur J Oper Res. 1996;90:45–55.

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Schrage L. Formulation and structure of more complex/realistic routing and scheduling problems. Networks 1981;11:229–232.

    Article  Google Scholar 

  • Shieh H-M, May M-D. On-line vehicle routing with time windows: optimization-based heuristics approach for freight demands requested in real-time. Transport Res Rec J Transport Res Board 1617, Washington, D.C.: Transportation Research Board of the National Academies; 1998, p. 171–178.

    Google Scholar 

  • Stickel M, Darger J, Furmans K. Vehicle routing with regard to traffic prognosis and congestion probabilities. Adv OR AI Method Transport. 2005;1:780–786.

    Google Scholar 

  • Taniguchi E, Thompson R. Modeling city logistics. Transport Res Rec J Transport Res Board 1790, Washington, D.C.: Transportation Research Board of the National Academies; 2002. p. 45–51.

    Google Scholar 

  • Toth P, Vigo D (eds.) The vehicle routing problem. SIAM monographs on discrete mathematics and applications. Philadelphia: SIAM; 2002.

    Google Scholar 

  • Ukkusuri SV, Waller ST. Linear programming models for the user and system optimal dynamic network design problem: formulations, comparisons and extensions. Network Spatial Econ. 2008;8:383–406.

    Article  Google Scholar 

  • Ukkusuri SV, Ramadurai G, Patil G. A robust transportation signal control problem accounting for traffic dynamics. Comput Oper Res. 2010;37:869–879.

    Article  Google Scholar 

  • Woensel TV, Kerbache L, Peremans H, Vandaele N. Vehicle routing with dynamic travel times: A queueing approach. Eur J Oper Res. 2008;186:990–1007.

    Article  Google Scholar 

  • Zheng H, Chiu Y-C. A network flow algorithm for the cell-based single-destination system optimal dynamic traffic assignment problem. Transport Sci. 2011;45:121–137.

    Article  Google Scholar 

  • Ziliaskopoulos AK. A linear programming model for the single destination system optimum dynamic traffic assignment problem. Transport Sci. 2000;34:37–49.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Satish V. Ukkusuri .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this chapter

Cite this chapter

Aziz, H.M.A., Ukkusuri, S.V. (2013). An Approach to Assess the Impact of Dynamic Congestion in Vehicle Routing Problems. In: Ukkusuri, S., Ozbay, K. (eds) Advances in Dynamic Network Modeling in Complex Transportation Systems. Complex Networks and Dynamic Systems, vol 2. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-6243-9_11

Download citation

Publish with us

Policies and ethics