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

Abstract

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.