A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint that states that any new item must be loaded on top of a stack and any unloaded item must be on top of its stack. A branch-and-cut algorithm is proposed for solving this problem. Computational results are reported on different types of randomly generated instances as well as on classical instances for some well-known special cases of the problem. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.

[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]  Raffaele Cerulli,et al.  A Branch-and-Bound Algorithm for the Double TSP with Two Stacks , 2010 .

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

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

[5]  Michel Gendreau,et al.  A Tabu Search Algorithm for a Routing and Container Loading Problem , 2006, Transp. Sci..

[6]  Guenther Fuellerer,et al.  Metaheuristics for the vehicle routing problem with loading constraints , 2007, Networks.

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

[8]  Jean-François Cordeau,et al.  A Branch-and-Cut Algorithm for the Dial-a-Ride Problem , 2006, Oper. Res..

[9]  Daniele Vigo,et al.  An Exact Approach for the Vehicle Routing Problem with Two-Dimensional Loading Constraints , 2007, Transp. Sci..

[10]  Manuel Iori,et al.  Heuristic and exact algorithms for the multi-pile vehicle routing problem , 2011, OR Spectr..

[11]  Gilbert Laporte,et al.  The pickup and delivery traveling salesman problem with first-in-first-out loading , 2009, Comput. Oper. Res..

[12]  Gregory Levitin,et al.  Optimal routing of multiple-load AGV subject to LIFO loading constraints , 2003, Comput. Oper. Res..

[13]  Jean-François Cordeau,et al.  Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows , 2009, Transp. Sci..

[14]  Guenther Fuellerer,et al.  Metaheuristics for vehicle routing problems with three-dimensional loading constraints , 2010, Eur. J. Oper. Res..

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

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

[17]  Shaul P. Ladany,et al.  OPTIMAL ROUTING OF A SINGLE VEHICLE WITH LOADING AND UNLOADING CONSTRAINTS , 1984 .

[18]  Gilbert Laporte,et al.  The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm , 2009, Math. Program..

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

[20]  Michel Gendreau,et al.  A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints , 2008, Networks.

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

[22]  Mauro Dell'Amico,et al.  Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading , 2010, Comput. Oper. Res..

[23]  Guenther Fuellerer,et al.  Ant colony optimization for the two-dimensional loading vehicle routing problem , 2009, Comput. Oper. Res..

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

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

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

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

[28]  Egon Balas,et al.  The precedence-constrained asymmetric traveling salesman polytope , 1995, Math. Program..

[29]  Alberto Ceselli,et al.  Efficient algorithms for the double traveling salesman problem with multiple stacks , 2012, Comput. Oper. Res..

[30]  K. Ruland,et al.  The pickup and delivery problem: Faces and branch-and-cut algorithm , 1997 .

[31]  Gilbert Laporte,et al.  Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows , 2007, Networks.

[32]  Daniele Vigo,et al.  The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs , 2010, Transp. Sci..

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

[34]  Jens Lysgaard.  Reachability cuts for the vehicle routing problem with time windows , 2006, Eur. J. Oper. Res..

[35]  Juan José Salazar González,et al.  A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading , 2010, Networks.