A reactive tabu search for the vehicle routing problem

The classical vehicle routing problem (VRP) involves determining a fleet of homogeneous size vehicles and designing an associated set of routes that minimizes the total cost. Our tabu search (TS) algorithm to solve the VRP is based on reactive tabu search (RTS) with a new escape mechanism, which manipulates different neighbourhood schemes in a very sophisticated way in order to get a balanced intensification and diversification continuously during the search process. We compare our algorithm with the best methods in the literature using different data sets and report results including new best known solutions for several well-known benchmark problems.

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

[2]  Said Salhi,et al.  Improvements to Vehicle Routing Heuristics , 1987 .

[3]  Niaz A. Wassan,et al.  A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls , 2002 .

[4]  Gilbert Laporte,et al.  Classical and modern heuristics for the vehicle routing problem , 2000 .

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

[6]  Roberto Battiti,et al.  The Reactive Tabu Search , 1994, INFORMS J. Comput..

[7]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..

[8]  Robert A. Russell,et al.  Technical Note - An Effective Heuristic for the M-Tour Traveling Salesman Problem with Some Side Conditions , 1977, Oper. Res..

[9]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[10]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[11]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[12]  Rekha Pillai,et al.  A TSSP+1 decomposition strategy for the vehicle routing problem , 1994 .

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

[14]  P. L. Juliff,et al.  Program design , 1986 .

[15]  Catherine Roucairol,et al.  A Parallel Tabu Search Algorithm Using Ejection Chains for the Vehicle Routing Problem , 1996 .

[16]  Said Salhi,et al.  Incorporating vehicle routing into the vehicle fleet composition problem , 1993 .

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

[18]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[19]  Gilbert Laporte,et al.  Routing problems: A bibliography , 1995, Ann. Oper. Res..

[20]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..

[21]  Said Salhi,et al.  Improvements to Vehicle Routeing Heuristics , 1987 .

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

[23]  James P. Kelly,et al.  A Network Flow-Based Tabu Search Heuristic for the Vehicle Routing Problem , 1996, Transp. Sci..