A tabu search heuristic for the vehicle routing problem with time windows and split deliveries

Abstract The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle routing problems (VRP) arise in many real-life applications within transportation and logistics. In this paper, we study a variant of the general VRP, VRP with time windows and split deliveries (VRPTWSD). Time constrained routing is relevant for applications where a schedule has to be followed. The option of splitting a demand makes it possible to service a customer whose demand exceeds the vehicle capacity. Splitting also allows to decrease costs. Although VRPTWSD is a relaxation of the VRP with time windows, the problem does not become easier to solve, and is still NP-hard. In this work, we propose a solution method based on tabu search for solving the VRPTWSD without imposing any restrictions on the split delivery options. We also give an analysis of experimental results on problems with 100 customers.

[1]  José-Manuel Belenguer,et al.  A Lower Bound for the Split Delivery Vehicle Routing Problem , 2000, Oper. Res..

[2]  Patrick Prosser,et al.  Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics , 2000, J. Heuristics.

[3]  J. W. Giffin,et al.  The split delivery vehicle scheduling problem with time windows and grid network distances , 1995, Comput. Oper. Res..

[4]  Moshe Dror,et al.  Savings by Split Delivery Routing , 1989, Transp. Sci..

[5]  Gilbert Laporte,et al.  New Insertion and Postoptimization Procedures for the Traveling Salesman Problem , 1992, Oper. Res..

[6]  Gilbert Laporte,et al.  A unified tabu search heuristic for vehicle routing problems with time windows , 2001, J. Oper. Res. Soc..

[7]  Jörg Homberger,et al.  Two Evolutionary Metaheuristics For The Vehicle Routing Problem With Time Windows , 1999 .

[8]  Moshe Dror,et al.  Vehicle routing with split deliveries , 1994, Discret. Appl. Math..

[9]  Jesper Bach Larsen.  Vehicle Routing with Time Windows -- Finding optimal solutions efficiently , 1999 .

[10]  Michel Gendreau,et al.  A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows , 1998, Oper. Res..

[11]  Russell Bent,et al.  A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows , 2004, Transp. Sci..

[12]  Michel Gendreau,et al.  METAHEURISTICS FOR THE VEHICLE ROUTING PROBLEM. , 1994 .

[13]  Jean-François Cordeau,et al.  VRP with Time Windows , 1999, The Vehicle Routing Problem.

[14]  M. Dror,et al.  Split delivery routing , 1990 .

[15]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows , 1997, Transp. Sci..

[16]  Luca Maria Gambardella,et al.  MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows , 1999 .

[17]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

[18]  Yves Rochat,et al.  Probabilistic diversification and intensification in local search for vehicle routing , 1995, J. Heuristics.

[19]  J. K. Lenstra,et al.  Complexity of vehicle routing and scheduling problems , 1981, Networks.

[20]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[21]  Moshe Dror,et al.  Split-delivery routeing heuristics in livestock feed distribution , 1997 .

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

[23]  Riccardo Poli,et al.  New ideas in optimization , 1999 .

[24]  Robert A. Russell,et al.  Hybrid Heuristics for the Vehicle Routing Problem with Time Windows , 1995, Transp. Sci..

[25]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.