A HYBRID TABU SEARCH FOR A VEHICLE ROUTING PROBLEM WITH DOUBLE TIME WINDOWS FOR THE DEPOT AND MULTIPLE USE OF VEHICLES: CASE OF FUEL DELIVERY

We address in this paper a distribution real case problem facing the fuel supplying companies. The cost of acquiring vehicles is often more significant than the routing cost. The goal is to minimise the number of required vehicles. We deal with a vehicle routing problem with double time windows for the depot and multiple use of vehicles (VRPDM). There is a single depot with double time windows, the first window is for travelling and the second one (smaller) is for loading vehicles. The problem consists of designing and assigning routes to vehicles while considering time windows and capacity constraints. To solve this problem a hybrid tabu search based approach is proposed with a new heuristic for scheduling and assignment routes to vehicles. The computational results are reported for a set of 70 instances with 100 clients, and compared to those of evolutionary approach.

[1]  Arun Kumar,et al.  Vehicle Routing with Cross Docks, Split Deliveries, and Multiple Use of Vehicles , 2011 .

[2]  J. F. Pierce,et al.  ON THE TRUCK DISPATCHING PROBLEM , 1971 .

[3]  C. K. Y. Lin,et al.  Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data , 2006, Eur. J. Oper. Res..

[4]  Michel Gendreau,et al.  An exact algorithm for a single-vehicle routing problem with time windows and multiple routes , 2007, Eur. J. Oper. Res..

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

[6]  Yupo Chan,et al.  The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations , 2005, Math. Comput. Model..

[7]  Éric D. Taillard,et al.  Parallel iterative search methods for vehicle routing problems , 1993, Networks.

[8]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[9]  Daniel J. Rosenkrantz,et al.  An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[10]  Yupo Chan,et al.  A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands , 2001, Comput. Oper. Res..

[11]  Jaime Cerdá,et al.  AN OPTIMAL APPROACH TO THE MULTIPLE-DEPOT HETEROGENEOUS VEHICLE ROUTING PROBLEM WITH TIME WINDOW AND CAPACITY CONSTRAINTS , 2003 .

[12]  Martin W. P. Savelsbergh,et al.  Decision Support for Consumer Direct Grocery Initiatives , 2005, Transp. Sci..

[13]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[14]  Alan Mercer,et al.  A tabu search algorithm for the multi-trip vehicle routing and scheduling problem , 1997, Eur. J. Oper. Res..

[15]  Michel Gendreau,et al.  Vehicle Routeing with Multiple Use of Vehicles , 1996 .

[16]  John E. Beasley,et al.  A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions , 2008, J. Oper. Res. Soc..

[17]  Martin W. P. Savelsbergh,et al.  Efficient Insertion Heuristics for Vehicle Routing and Scheduling Problems , 2004, Transp. Sci..