A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers

The purpose of this article is to propose a perturbation metaheuristic for the vehicle routing problem with private fleet and common carrier (VRPPC). This problem consists of serving all customers in such a way that (1) each customer is served exactly once either by a private fleet vehicle or by a common carrier vehicle, (2) all routes associated with the private fleet start and end at the depot, (3) each private fleet vehicle performs only one route, (4) the total demand of any route does not exceed the capacity of the vehicle assigned to it, and (5) the total cost is minimized. This article describes a new metaheuristic for the VRPPC, which uses a perturbation procedure in the construction and improvement phases and also performs exchanges between the sets of customers served by the private fleet and the common carrier. Extensive computational results show the superiority of the proposed metaheuristic over previous methods.

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

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

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

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

[5]  Gilbert Laporte,et al.  A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem , 2003, Eur. J. Oper. Res..

[6]  Michel Gendreau,et al.  A tabu search heuristic for the heterogeneous fleet vehicle routing problem , 1999, Comput. Oper. Res..

[7]  André Langevin,et al.  Logistics systems : design and optimization , 2005 .

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

[9]  James P. Kelly,et al.  The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results , 1998 .

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

[11]  Richard F. Hartl,et al.  D-Ants: Savings Based Ants divide and conquer the vehicle routing problem , 2004, Comput. Oper. Res..

[12]  Lawrence Bodin,et al.  PLANNING FOR TRUCK FLEET SIZE IN THE PRESENCE OF A COMMON‐CARRIER OPTION , 1983 .

[13]  Michael Rubinovitch.  A Probabilistic Model for Optimal Project Scheduling , 1972, Oper. Res..

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

[15]  Jacques Renaud,et al.  A sweep-based algorithm for the fleet size and mix vehicle routing problem , 2002, Eur. J. Oper. Res..

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

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

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

[19]  Leyuan Shi,et al.  New parallel randomized algorithms for the traveling salesman problem , 1999, Comput. Oper. Res..

[20]  R. A. Zemlin,et al.  Integer Programming Formulation of Traveling Salesman Problems , 1960, JACM.

[21]  P. C. Yellow,et al.  A Computational Modification to the Savings Method of Vehicle Scheduling , 1970 .

[22]  P. Bhave,et al.  Integer programming formulations of vehicle routing problems , 1985 .

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

[24]  Thomas L. Magnanti,et al.  Implementing vehicle routing algorithms , 1977, Networks.

[25]  Bruce L. Golden,et al.  Very large-scale vehicle routing: new test problems, algorithms, and results , 2005, Comput. Oper. Res..

[26]  Michel Gendreau,et al.  New Heuristics for the Vehicle Routing Problem , 2005 .

[27]  Bruce L. Golden,et al.  A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem , 2007, Comput. Oper. Res..

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

[29]  Éric D. Taillard,et al.  A heuristic column generation method for the heterogeneous fleet VRP , 1999, RAIRO Oper. Res..