journal article Open Access Aug 17, 2015

Dynamic vehicle routing problems: Three decades and counting

Networks Vol. 67 No. 1 pp. 3-31 · Wiley
View at Publisher Save 10.1002/net.21628
Abstract
Since the late 70s, much research activity has taken place on the class of dynamic vehicle routing problems (DVRP), with the time period after year 2000 witnessing a real explosion in related papers. Our paper sheds more light into work in this area over more than 3 decades by developing a taxonomy of DVRP papers according to 11 criteria. These are (1) type of problem, (2) logistical context, (3) transportation mode, (4) objective function, (5) fleet size, (6) time constraints, (7) vehicle capacity constraints, (8) the ability to reject customers, (9) the nature of the dynamic element, (10) the nature of the stochasticity (if any), and (11) the solution method. We comment on technological vis‐à‐vis methodological advances for this class of problems and suggest directions for further research. The latter include alternative objective functions, vehicle speed as decision variable, more explicit linkages of methodology to technological advances and analysis of worst case or average case performance of heuristics. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 67(1), 3–31 2016
Topics

No keywords indexed for this article. Browse by subject →

References
169
[1]
Adler J.A. (2014)
[2]
Adulyassak Y. "Models and algorithms for stochastic and robust vehicle routing with deadlines" Transport Sci
[4]
Attanasio A. (2007)
[7]
Barcelo J. (2007)
[12]
Bektaş T. (2014)
[13]
Bektaş T. (2015)
[17]
Bertsekas D.P. (2012)
[33]
Colmant A.
[34]
Cordeau J.‐F. (2007)
[35]
J.F.Côté M.Gendreau andJ.‐Y.Potvin The vehicle routing problem with stochastic two‐dimensional items CIRRELT working paper CIRRELT‐2013‐84 2013.
[40]
DHL(2013) Big data in logistics: A DHL perspective on how to move beyond the hype DHL Customer Solutions & Innovation December 2013. Available at:http://www.delivering-tomorrow.com/wp-content/uploads/2014/02/CSI_Studie_BIG_DATA_FINAL-ONLINE.pdf. Accessed on May 25 2015.
[45]
F.Errico G.Desaulniers M.Gendreau W.Rei andL.‐M.Rousseau The vehicle routing problem with hard time windows and stochastic service times Les Cahiers du GERAD Quebec G‐2013‐45 2013.

Showing 50 of 169 references

Cited By
311
Computers & Operations Research
Computers & Operations Research
International Journal of Production...
European Journal of Operational Res...
Computers & Industrial Engineer...
Transportation Research Part C: Eme...
IEEE Transactions on Intelligent Tr...
Electric Vehicle Routing with Public Charging Stations

Nicholas D. Kullman, Justin C. Goodson · 2021

Transportation Science
Journal of Scheduling
Transportation Science
Metrics
311
Citations
169
References
Details
Published
Aug 17, 2015
Vol/Issue
67(1)
Pages
3-31
License
View
Cite This Article
Harilaos N. Psaraftis, Min Wen, Christos A. Kontovas (2015). Dynamic vehicle routing problems: Three decades and counting. Networks, 67(1), 3-31. https://doi.org/10.1002/net.21628
Related

You May Also Like

Complexity of vehicle routing and scheduling problems

J. K. Lenstra, A. H. G. Rinnooy Kan · 1981

938 citations

A generalized assignment heuristic for vehicle routing

Marshall L. Fisher, Ramchandran Jaikumar · 1981

736 citations

SNDlib 1.0—Survivable Network Design Library

S. Orlowski, R. Wessäly · 2009

691 citations

Total domination in graphs

E. J. Cockayne, R. M. Dawes · 1980

419 citations