A Branch-and-Cut Algorithm for the Single Truck and Trailer Routing Problem with Satellite Depots

In the single truck and trailer routing problem with satellite depots (STTRPSD), a truck with a detachable trailer based at a main depot must serve the demand of a set of customers accessible only by truck. Therefore, before serving the customers, it is necessary to detach the trailer in an appropriate parking place (called either a satellite depot or a trailer point) and transfer goods between the truck and the trailer. This problem has applications in milk collection for farms that cannot be reached using large vehicles. In this work we present an integer programming formulation of the STTRPSD. This formulation is tightened with several families of valid inequalities for which we have developed different (exact and heuristic) separation procedures. Using these elements, we have implemented a branch-and-cut algorithm for the solution of the STTRPSD. A computational experiment with published instances shows that the proposed branch-and-cut algorithm consistently solves problems with up to 50 customers and 10 satellite depots, and it has also been able to solve instances with up to 20 satellite depots and 100 clustered customers.

[1]  Gerhard Reinelt,et al.  A Faster Exact Separation Algorithm for Blossom Inequalities , 2004, IPCO.

[2]  Michael Drexl.  Branch-and-price and heuristic column generation for the generalized truck-and-trailer routing problem , 2011 .

[3]  I-Ming Chao,et al.  A tabu search method for the truck and trailer routing problem , 2002, Comput. Oper. Res..

[4]  Teodor Gabriel Crainic,et al.  Lower and upper bounds for the two-echelon capacitated location-routing problem , 2012, Comput. Oper. Res..

[5]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[6]  Ted K. Ralphs,et al.  Parallel branch and cut for capacitated vehicle routing , 2003, Parallel Comput..

[7]  Enrique Benavent,et al.  Multi-depot Multiple TSP: a polyhedral study and computational results , 2013, Ann. Oper. Res..

[8]  Shuo-Yan Chou,et al.  A note on the truck and trailer routing problem , 2010, Expert Syst. Appl..

[9]  Shuo-Yan Chou,et al.  Solving the truck and trailer routing problem based on a simulated annealing heuristic , 2009, Comput. Oper. Res..

[10]  Roberto Roberti,et al.  An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem , 2013, Oper. Res..

[11]  Nubia Velasco,et al.  A GRASP with evolutionary path relinking for the truck and trailer routing problem , 2011, Comput. Oper. Res..

[12]  T. C. Hu,et al.  Multi-Terminal Network Flows , 1961 .

[13]  Michael Drexl.  Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments , 2014, Networks.

[14]  Gilbert Laporte,et al.  A branch-and-cut algorithm for the Undirected Rural Postman Problem , 2000, Math. Program..

[15]  Reinaldo Morabito,et al.  Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW , 2012, Eur. J. Oper. Res..

[16]  Chung-Cheng Lu,et al.  A simulated annealing heuristic for the truck and trailer routing problem with time windows , 2011, Expert Syst. Appl..

[17]  Teodor Gabriel Crainic,et al.  An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics , 2012, Comput. Oper. Res..

[18]  R. Tadei,et al.  The two-echelon capacitated vehicle routing problem , 2008 .

[19]  T. Crainic,et al.  GRASP with Path Relinking for the Two-Echelon Vehicle Routing Problem , 2013 .

[20]  Arild Hoff,et al.  A Tabu search approach for milk collection in western Norway using trucks and trailers , 2008 .

[21]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[22]  Nubia Velasco,et al.  GRASP/VND and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots , 2010, Eng. Appl. Artif. Intell..

[23]  José-Manuel Belenguer,et al.  A Branch and Cut method for the Capacitated Location-Routing Problem , 2006, 2006 International Conference on Service Systems and Service Management.

[24]  Alexandre Salles da Cunha,et al.  Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem , 2013, Optim. Lett..

[25]  Teodor Gabriel Crainic,et al.  Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem , 2011, EvoCOP.

[26]  Michael Drexl,et al.  On some generalized routing problems , 2007 .

[27]  Ángel Corberán,et al.  Separating capacity constraints in the CVRP using tabu search , 1998, Eur. J. Oper. Res..

[28]  Simon Spoorendonk,et al.  A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem , 2013, Transp. Sci..

[29]  Nubia Velasco,et al.  A matheuristic for the truck and trailer routing problem , 2013, Eur. J. Oper. Res..

[30]  Massimiliano Caramia,et al.  A Milk Collection Problem with Incompatibility Constraints , 2010, Interfaces.

[31]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[32]  Daniele Vigo,et al.  The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics , 2011, Transp. Sci..

[33]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[34]  Maria Grazia Speranza,et al.  A survey on two-echelon routing problems , 2015, Comput. Oper. Res..

[35]  Stephan Scheuerer,et al.  A tabu search heuristic for the truck and trailer routing problem , 2006, Comput. Oper. Res..

[36]  Jean-François Cordeau,et al.  A computational comparison of flow formulations for the capacitated location-routing problem , 2013, Discret. Optim..

[37]  Adam N. Letchford,et al.  A new branch-and-cut algorithm for the capacitated vehicle routing problem , 2004, Math. Program..

[38]  Ulrich Derigs,et al.  Truck and trailer routing - Problems, heuristics and computational experience , 2013, Comput. Oper. Res..

[39]  Massimiliano Caramia,et al.  A heuristic approach for the truck and trailer routing problem , 2010, J. Oper. Res. Soc..