An exact method for the double TSP with multiple stacks

The double travelling salesman problem (TSP) with multiple stacks (DTSPMS) is a pickup and delivery problem in which all pickups must be completed before any deliveries can be made. The problem originates from a real-life application where a 40-foot container (configured as 11 rows of three columns) is used to transport 33 pallets from a set of pickup customers to a set of delivery customers. The pickups and deliveries are performed in two separate trips, where each trip starts and ends at a depot and visits a number of customers. The aim of the problem is to produce a packing plan for the pallets that minimizes the total transportation cost given that the container cannot be repacked at any stage. In this paper we present an exact solution method based on matching k-best tours to each of the separate pickup and delivery TSPs. The approach is shown to outperform the only known previous exact method for this problem in that solutions can be obtained faster and previously unsolved instances containing as many as 18 customers can now be solved to optimality.

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

[2]  Sophie N. Parragh,et al.  A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .

[3]  M. Teresa Ortuño,et al.  Neighborhood Structures To Solve The Double TSP With Multiple Stacks Using Local Search , 2008 .

[4]  Juan José Salazar González,et al.  A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery , 2004, Discret. Appl. Math..

[5]  Ton Volgenant,et al.  The symmetric clustered traveling salesman problem , 1985 .

[6]  Sophie N. Parragh,et al.  A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .

[7]  Jean-François Cordeau,et al.  An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading , 2007 .

[8]  M. Queyranne,et al.  K best solutions to combinatorial optimization problems , 1985 .

[9]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[10]  E. Lawler.  A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

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

[12]  Gerard Sierksma,et al.  Solving the k-best traveling salesman problem , 1999, Comput. Oper. Res..

[13]  Juan José Salazar González,et al.  The One-Commodity Pickup-and-Delivery Travelling Salesman Problem , 2001, Combinatorial Optimization.

[14]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

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