A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks

The double traveling salesman problem with multiple stacks is a variant of the pickup and delivery traveling salesman problem in which all pickups must be completed before any delivery. In addition, items can be loaded on multiple stacks in the vehicle, and each stack must obey the last-in-first-out policy. The problem consists of finding the shortest Hamiltonian cycles covering all pickup and delivery locations while ensuring the feasibility of the loading plan. We formulate the problem as two traveling salesman problems linked by infeasible path constraints. We also introduce several strengthenings of these constraints, which are used within a branch-and-cut algorithm. Computational results performed on instances from the literature show that the algorithm outperforms existing exact algorithms. Instances with up to 28 requests 58 nodes have been solved to optimality.

[1]  James E. Kelley,et al.  Critical-Path Planning and Scheduling: Mathematical Basis , 1961 .

[2]  Oli B. G. Madsen,et al.  The double travelling salesman problem with multiple stacks - Formulation and heuristic solution approaches , 2009, Eur. J. Oper. Res..

[3]  Maria Grazia Speranza,et al.  Exact solutions to the double travelling salesman problem with multiple stacks , 2010, Networks.

[4]  Gianpaolo Oriolo,et al.  Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem , 2010, Theor. Comput. Sci..

[5]  Pierre Hansen,et al.  Bounded vertex colorings of graphs , 1990, Discret. Math..

[6]  Matteo Fischetti,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.

[7]  G. Laporte,et al.  Transportation Demand , 2019, Energy: Supply and Demand.

[8]  Jean-François Cordeau,et al.  An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading , 2007, INFOR Inf. Syst. Oper. Res..

[9]  George L. Nemhauser,et al.  Handbooks in operations research and management science , 1989 .

[10]  Gilbert Laporte,et al.  Chapter 7 Transportation on Demand , 2007, Transportation.

[11]  Manuel Iori,et al.  Routing problems with loading constraints , 2010 .

[12]  Gregorio Tirado,et al.  New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks , 2009 .

[13]  Maria Grazia Speranza,et al.  A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks , 2013, Networks.

[14]  Gregorio Tirado,et al.  The double traveling salesman problem with multiple stacks: A variable neighborhood search approach , 2009, Comput. Oper. Res..

[15]  Raffaele Cerulli,et al.  A Branch-and-Bound Algorithm for the Double TSP with Two Stacks , 2010 .

[16]  Sophie Toulouse,et al.  On the Complexity of the Multiple Stack TSP, kSTSP , 2009, TAMC.

[17]  Matthias Ehrgott,et al.  An exact method for the double TSP with multiple stacks , 2010, Int. Trans. Oper. Res..

[18]  G. Laporte,et al.  A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading , 2010 .

[19]  Michel Gendreau,et al.  Large Neighborhood Search for the Single Vehicle Pickup and Delivery Problem with Multiple Loading Stacks , 2009 .

[20]  Gilbert Laporte,et al.  Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading , 2007, INFORMS J. Comput..

[21]  Sophie Toulouse.  Approximability of the Multiple Stack TSP , 2010, Electron. Notes Discret. Math..

[22]  James E. Kelley,et al.  Critical-path planning and scheduling , 1899, IRE-AIEE-ACM '59 (Eastern).