Article ID: | iaor2016222 |
Volume: | 67 |
Issue: | 1 |
Start Page Number: | 3 |
End Page Number: | 31 |
Publication Date: | Jan 2016 |
Journal: | Networks |
Authors: | Psaraftis Harilaos N, Kontovas Christos A, Wen Min |
Keywords: | programming: dynamic, combinatorial optimization, networks |
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.