A tabu search algorithm for the open vehicle routing problem

Abstract The problem studied in this paper is different from the basic vehicle routing problem in that the vehicles do not return to the distribution depot after delivering the goods to the customers or, if they do so, they must visit the same customers, for the collection of goods, in the reverse order. The practical importance of this problem has been established some decades ago, but it has received very little attention from researchers. In this paper we present a new tabu search algorithm that explores the structure of this type of problem and we compare its performance with another heuristic designed for the same purpose, which has been published recently.

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

[2]  Paolo Toth,et al.  The Granular Tabu Search and Its Application to the Vehicle-Routing Problem , 2003, INFORMS J. Comput..

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

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

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

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

[7]  Teodor Gabriel Crainic,et al.  Fleet management and logistics , 1998 .

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

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

[10]  Narsingh Deo,et al.  Discrete Optimization Algorithms: with Pascal Programs , 2006 .

[11]  Paolo Toth,et al.  Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..

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

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

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

[15]  D Sariklis,et al.  A heuristic method for the open vehicle routing problem , 2000, J. Oper. Res. Soc..

[16]  Nicos Christofides,et al.  The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.

[17]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[18]  Alan Mercer,et al.  The multi-trip vehicle routing problem , 1998, J. Oper. Res. Soc..

[19]  José Brandão.  A Lower Bound Based Meta-Heuristic for the Vehicle Routing Problem , 2002 .

[20]  Alex Van Breedam,et al.  Comparing descent heuristics and metaheuristics for the vehicle routing problem , 2001, Comput. Oper. Res..

[21]  Nicos Christofides,et al.  Combinatorial optimization , 1979 .

[22]  Linus Schrage,et al.  Formulation and structure of more complex/realistic routing and scheduling problems , 1981, Networks.

[23]  C. Ribeiro,et al.  Essays and Surveys in Metaheuristics , 2002, Operations Research/Computer Science Interfaces Series.

[24]  Marshall L. Fisher.  A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem , 1994, Oper. Res..