The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm

The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-to-one relationship. The problem consists of determining a minimum cost tour such that each pickup vertex is visited before its corresponding delivery vertex. In this paper, the TSPPD is modeled as an integer linear program and its polyhedral structure is analyzed. In particular, the dimension of the TSPPD polytope is determined and several valid inequalities, some of which are facet defining, are introduced. Separation procedures and a branch-and-cut algorithm are developed. Computational results show that the algorithm is capable of solving to optimality instances involving up to 35 pickup and delivery requests, thus more than doubling the previous record of 15.

[1]  Jacques Renaud,et al.  A heuristic for the pickup and delivery traveling salesman problem , 2000, Comput. Oper. Res..

[2]  I. Dumitrescu.  Polyhedral Results for the Pickup and Delivery Travelling Salesman Problem , 2008 .

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

[4]  David Pisinger,et al.  An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows , 2006, Transp. Sci..

[5]  Gilbert Laporte,et al.  Perturbation heuristics for the pickup and delivery traveling salesman problem , 2002, Comput. Oper. Res..

[6]  W. R. Pulleyblank,et al.  Precedence Constrained Routing and Helicopter Scheduling: Heuristic Design , 1992 .

[7]  Gerhard Reinelt,et al.  TSPLIB - A Traveling Salesman Problem Library , 1991, INFORMS J. Comput..

[8]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[9]  Arthur V. Hill,et al.  An algorithm for the traveling salesman problem with pickup and delivery customers , 1985 .

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

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

[12]  Gilbert Laporte,et al.  Recent Models and Algorithms for One-to-One Pickup and Delivery Problems , 2008 .

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

[14]  Stefan Irnich,et al.  Shortest Path Problems with Resource Constraints , 2005 .

[15]  Michel Gendreau,et al.  The Traveling Salesman Problem with Backhauls , 1996, Comput. Oper. Res..

[16]  P. Healy,et al.  A new extension of local search applied to the Dial-A-Ride Problem , 1995 .

[17]  Michael Jünger,et al.  A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints , 2000, Comput. Optim. Appl..

[18]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[19]  Maged M. Dessouky,et al.  An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem , 2004, Transp. Sci..

[20]  M. Savelsbergh.  An efficient implementation of local search algorithms for constrained routing problems , 1990 .

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

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

[23]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .