The time dependent traveling salesman problem: polyhedra and algorithm

The time dependent traveling salesman problem (TDTSP) is a generalization of the classical traveling salesman problem (TSP), where arc costs depend on their position in the tour with respect to the source node. While TSP instances with thousands of vertices can be solved routinely, there are very challenging TDTSP instances with less than 100 vertices. In this work, we study the polytope associated to the TDTSP formulation by Picard and Queyranne, which can be viewed as an extended formulation of the TSP. We determine the dimension of the TDTSP polytope and identify several families of facet-defining cuts. We obtain good computational results with a branch-cut-and-price algorithm using the new cuts, solving almost all instances from the TSPLIB with up to 107 vertices.

[1]  Gilles Savard,et al.  The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times , 2006, Discret. Optim..

[2]  Stephen C. Graves,et al.  Technical Note - An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem , 1980, Oper. Res..

[3]  Abraham P. Punnen,et al.  The traveling salesman problem and its variations , 2007 .

[4]  D. Gale.  A theorem on flows in networks , 1957 .

[5]  Isabel Méndez-Díaz,et al.  A new formulation for the Traveling Deliveryman Problem , 2008, Discret. Appl. Math..

[6]  M. Jacob.  A personal communication , 1989 .

[7]  Eugene L. Lawler,et al.  Traveling Salesman Problem , 2016 .

[8]  Maurice Queyranne,et al.  The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling , 1978, Oper. Res..

[9]  S. Voß,et al.  A classification of formulations for the (time-dependent) traveling salesman problem , 1995 .

[10]  Juan José Miranda Bront,et al.  An integer programming approach for the time-dependent TSP , 2010, Electron. Notes Discret. Math..

[11]  Alan J. Hoffman,et al.  SOME RECENT APPLICATIONS OF THE THEORY OF LINEAR INEQUALITIES TO EXTREMAL COMBINATORIAL ANALYSIS , 2003 .

[12]  Marcus Poggi de Aragão,et al.  Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems , 2008 .

[13]  Abilio Lucena,et al.  Time-dependent traveling salesman problem-the deliveryman case , 1990, Networks.

[14]  Marcus Poggi de Aragão,et al.  Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems , 2010, Math. Program. Comput..

[15]  William J. Cook,et al.  Solution of a Large-Scale Traveling-Salesman Problem , 1954, 50 Years of Integer Programming.

[16]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[17]  Martin Grötschel,et al.  On the symmetric travelling salesman problem II: Lifting theorems and facets , 1979, Math. Program..

[18]  Michael J. Todd,et al.  Mathematical programming , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[19]  T. Ralphs,et al.  COIN/BCP User’s Manual , 2001 .

[20]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[21]  Luís Gouveia,et al.  Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs , 2011, Math. Program..

[22]  P. Hall.  On Representatives of Subsets , 1935 .

[23]  Russ J. Vander Wiel,et al.  An exact solution approach for the time‐dependent traveling‐salesman problem , 1996 .

[24]  Luís Gouveia,et al.  Natural and extended formulations for the Time-Dependent Traveling Salesman Problem , 2014, Discret. Appl. Math..

[25]  Marcus Poggi de Aragão,et al.  A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem , 2007, WEA.

[26]  Marcus Poggi de Aragão,et al.  A robust branch‐cut‐and‐price algorithm for the heterogeneous fleet vehicle routing problem , 2009, Networks.

[27]  Egon Balas,et al.  New facets of the STS polytope generated from known facets of the ATS polytope , 2006, Discret. Optim..

[28]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

[29]  Bruce L. Golden,et al.  The vehicle routing problem : latest advances and new challenges , 2008 .

[30]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .