A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars

The purpose of this article is to propose a tabu search heuristic for the split delivery Vehicle Routing Problem with Production and Demand Calendars (VRPPDC). This new problem consists of determining which customers will be served by a common carrier, as well as the delivery routes for those served by the private fleet, in order to minimize the overall transportation and inventory costs. We first model this problem and then propose a simple decomposition procedure that can be used to provide a starting solution. Next, we introduce a new tabu search heuristic and we describe two new neighbor reduction strategies. Finally, we present the results of our extensive computational tests. According to these tests, our reduction strategies are efficient not only at reducing computing time but also at improving the overall solution quality.

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

[2]  Shuang Chen,et al.  Model and algorithm for inventory/routing decision in a three-echelon logistics system , 2008, Eur. J. Oper. Res..

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

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

[5]  Matteo Salani,et al.  Branch and price for the vehicle routing problem with discrete split deliveries and time windows , 2011, Eur. J. Oper. Res..

[6]  Christos D. Tarantilis,et al.  BoneRoute: An Adaptive Memory-Based Method for Effective Fleet Management , 2002, Ann. Oper. Res..

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

[8]  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..

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

[10]  Christian Prins,et al.  A reactive GRASP and path relinking for a combined production-distribution problem , 2007, Comput. Oper. Res..

[11]  Claudia Archetti,et al.  To Split or not to Split: That is the Question , 2008 .

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

[13]  Victor J. Rayward-Smith,et al.  Modern Heuristic Search Methods , 1996 .

[14]  Alain Hertz,et al.  A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem , 2003, Transp. Sci..

[15]  Feng Chu,et al.  A solution approach to the inventory routing problem in a three-level distribution system , 2011, Eur. J. Oper. Res..

[16]  Francesca Fumero,et al.  Synchronized Development of Production, Inventory, and Distribution Schedules , 1999, Transp. Sci..

[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]  Saïd Salhi,et al.  Inventory routing problems: a logistical overview , 2007, J. Oper. Res. Soc..

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

[21]  Martin W. P. Savelsbergh,et al.  Inventory Routing in Practice , 2002, The Vehicle Routing Problem.