A tabu search heuristic for the vehicle routing problem with private fleet and common carrier

This paper describes a tabu search heuristic for a vehicle routing problem where the owner of a private fleet can either visit a customer with one of his vehicles or assign the customer to a common carrier. The owner's objective is to minimize the variable and fixed costs for operating his fleet plus the total costs charged by the common carrier. The proposed tabu search is shown to outperform the best approach reported in the literature on 34 benchmark instances with a homogeneous fleet.

[1]  Egon Balas,et al.  The prize collecting traveling salesman problem , 1989, Networks.

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

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

[4]  Gilbert Laporte,et al.  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..

[5]  Nicos Christofides,et al.  An Algorithm for the Vehicle-dispatching Problem , 1969 .

[6]  Ching-Wu Chu,et al.  A heuristic algorithm for the truckload and less-than-truckload problem , 2005, Eur. J. Oper. Res..

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

[8]  Roy Jonker,et al.  On Some Generalizations of the Travelling-Salesman Problem , 1987 .

[9]  Jacques Renaud,et al.  A heuristic for the routing and carrier selection problem , 2007, Eur. J. Oper. Res..

[10]  Gilbert Laporte,et al.  A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers , 2008, J. Oper. Res. Soc..

[11]  David P. Williamson,et al.  A note on the prize collecting traveling salesman problem , 1993, Math. Program..

[12]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[13]  John G. Klincewicz,et al.  Fleet Size Planning when Outside Carrier Services Are Available , 1990, Transp. Sci..

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

[15]  R. Ramesh,et al.  The Distribution Problem with Carrier Service: A Dual Based Penalty Approach , 1995, INFORMS J. Comput..

[16]  Shen Lin.  Computer solutions of the traveling salesman problem , 1965 .

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

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