Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints

We propose a practical and flexible fixed routing system that preserves many of the benefits of traditional fixed routes but can be deployed in settings with medium to high variability and delivery time window constraints. The key ideas are the introduction of a new recourse strategy, in which customers are assigned to two planned routes, a primary and a backup, and recourse decisions can move customers to backup routes to regain feasibility or improve costs, and the use of sampling-based techniques to handle the presence of delivery time windows during the construction of primary and backup routes. A computational study based on real-life data demonstrates the efficacy of the proposed fixed routing system and the route construction techniques. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009

[1]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[2]  D. Bertsimas Probabilistic combinatorial optimization problems , 1988 .

[3]  Patrick Jaillet,et al.  A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited , 1988, Oper. Res..

[4]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[5]  Gilbert Laporte,et al.  An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers , 1995, Transp. Sci..

[6]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[7]  Gilbert Laporte,et al.  An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..

[8]  Brian Kallehauge,et al.  The Vehicle Routing Problem with Time Windows , 2006, Vehicle Routing.

[9]  Michel Gendreau,et al.  Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms , 2005, Transp. Sci..

[10]  Alan L. Erera,et al.  A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands , 2007, Transp. Sci..

[11]  Jens Lysgaard,et al.  A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands , 2007, Oper. Res. Lett..

[12]  Barrett W. Thomas,et al.  Probabilistic Traveling Salesman Problem with Deadlines , 2008, Transp. Sci..