Recent dynamic vehicle routing problems: a survey

2021 ◽  
pp. 107604
Author(s):  
Brenner Humberto Ojeda Rios ◽  
Eduardo C. Xavier ◽  
Flávio K. Miyazawa ◽  
Pedro Amorim ◽  
Eduardo Curcio ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems

Stable cooperation in dynamic vehicle routing problems

2015 ◽  
Vol 76 (5) ◽  
pp. 935-943 ◽  
Author(s):  
V. V. Zakharov ◽  
A. N. Shchegryaev
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems

Chapter 11: Dynamic Vehicle Routing Problems

2014 ◽  
pp. 299-347 ◽  
Author(s):  
Tolga Bekta¸s ◽  
Panagiotis P. Repoussis ◽  
Christos D. Tarantilis
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems

scholarly journals Supporting Humans in Solving Multi-UAV Dynamic Vehicle Routing Problems

2019 ◽  
Vol 52 (19) ◽  
pp. 359-364
Author(s):  
N.W. Klein Koerkamp ◽  
C. Borst ◽  
Max Mulder ◽  
M.M. van Paassen
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Multi Uav

Comparing Static and Dynamic Policies for Vehicle Routing Problems with Backhauling and Dynamic Customer Demands

2013 ◽  
Vol 4 (2) ◽  
pp. 1-17 ◽  
Author(s):  
Subrata Mitra
Keyword(s):  
Vehicle Routing ◽  
Heuristic Algorithms ◽  
Future Research ◽  
Vehicle Routing Problems ◽  
Dynamic Vehicle Routing ◽  
Routing Problems ◽  
Demand Information ◽  
Low Degrees ◽  
Special Case ◽  
Better Than

Dynamic vehicle routing problems with backhauling (VRPB), although important, have attracted little attention in the literature. Dynamic VRPB is more complex than dynamic vehicle routing problems (VRP) without backhauling, and since VRP without backhauling is a special case of VRPB, models and algorithms for dynamic VRPB can easily be adapted for dynamic VRP. In this paper, the author compared between static and dynamic policies for solving VRPB with dynamic occurrences of customer delivery and pickup demands. They developed heuristic algorithms for medium-sized problems under static and dynamic policies. Although dynamic policies are always at least as good as static policies, the author observed from numerical experimentations that static policies perform relatively well for low degrees of dynamism (dod). On the other hand, dynamic policies are expected to perform significantly better than static policies for high dod and early availabilities of dynamic customer delivery and pickup demand information. The author concludes the paper by providing directions for future research on dynamic VRPB.

Sign in / Sign up

Export Citation Format

Share Document