A Tabu Search Heuristic for a Full-Load, Multi-Terminal, Vehicle Scheduling Problem with Backhauling and Time Windows

The problem considered is the full-load pickup and delivery problem with time windows (PDPTW), and heterogeneous products and vehicles, where the assignment of pickup points to requests is not predetermined. Elements associated with tabu search, such as diversification by reversion to ‘junctions’ and the use of soft aspiration criteria, are embedded into our tabu search implementation. This metaheuristic is evaluated using random instances and selected data from a construction company in the U.K. The obtained results are compared against lower bounds from LP relaxation and also solutions from an existing multi-level heuristic.

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

[2]  Vladimir Vacic,et al.  VEHICLE ROUTING PROBLEM WITH TIME WINDOWS , 2014 .

[3]  Martin W. P. Savelsbergh,et al.  Drive: Dynamic Routing of Independent Vehicles , 1998, Oper. Res..

[4]  Daniele Vigo,et al.  Heuristics for the traveling salesman problem with pickup and delivery , 1999, Comput. Oper. Res..

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

[6]  Gilbert Laporte,et al.  Perturbation heuristics for the pickup and delivery traveling salesman problem , 2002, Comput. Oper. Res..

[7]  Ibrahim H. Osman,et al.  Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem , 1993, Ann. Oper. Res..

[8]  Roberto Wolfler Calvo,et al.  A New Heuristic for the Traveling Salesman Problem with Time Windows , 2000, Transp. Sci..

[9]  S. Salhi,et al.  Local Search Strategies for the Vehicle Fleet Mix Problem , 1996 .

[10]  Jean-Yves Potvin,et al.  Heuristic approaches to vehicle routing with backhauls and time windows , 1996, Comput. Oper. Res..

[11]  Michel Gendreau,et al.  Diversion Issues in Real-Time Vehicle Dispatching , 2000, Transp. Sci..

[12]  R Wolfler Calvo,et al.  A New Heuristic for the Travelling Salesman Problem with Time Windows. , 2000 .

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

[14]  Saïd Salhi,et al.  A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks , 2002, J. Comb. Optim..

[15]  Jacques Desrosiers,et al.  The Pickup and Delivery Problem with Time Windows , 1989 .

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

[17]  Jan Karel Lenstra,et al.  Variable-Depth Search for the Single-Vehicle Pickup and Delivery Problem with Time Windows , 1993, Transp. Sci..

[18]  Saïd Salhi,et al.  A Tabu Search Approach for the Resource Constrained Project Scheduling Problem , 1998, J. Heuristics.

[19]  Saïd Salhi,et al.  Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows , 2003, J. Oper. Res. Soc..

[20]  Fred W. Glover,et al.  A study of diversification strategies for the quadratic assignment problem , 1994, Comput. Oper. Res..

[21]  Roberto Baldacci,et al.  The Rollon-Rolloff Vehicle Routing Problem , 2000, Transp. Sci..

[22]  Fred W. Glover,et al.  Solving zero-one mixed integer programming problems using tabu search , 1998, European Journal of Operational Research.

[23]  Ibrahim H. Osman,et al.  Tabu search variants for the mix fleet vehicle routing problem , 2002, J. Oper. Res. Soc..

[24]  Saïd Salhi,et al.  Defining tabu list size and aspiration criterion within tabu search methods , 2002, Comput. Oper. Res..