A polyhedral study of the asymmetric traveling salesman problem with time windows

The asymmetric travelling salesman problem with time windows (ATSP-TW) is a basic model for scheduling and routing applications. In this paper we present a formulation of the problem involving only 0/1-variables associated with the arcs of the underlying digraph. This has the advantage of avoiding additional variables as well as the associated (typically very ineffective) linking constraints. In the formulation, time window restrictions are modelled by means of “infeasible path elimination” constraints. We present the basic form of these constraints along with some possible strengthenings. Several other classes of valid inequalities derived from related asymmetric travelling salesman problems are also described, along with a lifting theorem. We also study the ATSP-TW polytope, PTW , defined as the convex hull of the integer solutions of our model. We show that determining the dimension of PTW is strongly NP–complete problem, even if only one time window is present. In this latter case, we provide a minimal equation system for PTW . Computational experiments on the new formulation are reported in a companion paper [5] where we show that it outperforms alternative formulations on some classes of problem instances.

[1]  John N. Tsitsiklis,et al.  Special cases of traveling salesman and repairman problems with time windows , 1992, Networks.

[2]  van Ca Cleola Eijl A polyhedral approach to the delivery man problem , 1995 .

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

[4]  George L. Nemhauser,et al.  A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times , 1992 .

[5]  Egon Balas The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph , 1989, SIAM J. Discret. Math..

[6]  Matteo Fischetti,et al.  Facets of the Asymmetric Traveling Salesman Polytope , 1991, Math. Oper. Res..

[7]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[8]  David S. Johnson,et al.  Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..

[9]  Martin W. P. Savelsbergh,et al.  Local search in routing problems with time windows , 1984 .

[10]  Egon Balas,et al.  A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets , 1993, Math. Program..

[11]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[12]  Norbert Ascheuer,et al.  Hamiltonian path problems in the on-line optimization of flexible manufacturing systems , 1996 .

[13]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Time Windows: Minimizing Route Duration , 1992, INFORMS J. Comput..

[14]  Matteo Fischetti,et al.  Clique Tree Inequalities Define Facets of the Asymmetric Traveling Salesman Polytope , 1995, Discret. Appl. Math..

[15]  Matteo Fischetti,et al.  Three Facet-Lifting Theorems for the Asymmetric Traveling Salesman Polytope , 1992, IPCO.

[16]  Egon Balas,et al.  The Fixed-Outdegree 1-Arborescence Polytope , 1992, Math. Oper. Res..

[17]  Matteo Fischetti Clique tree inequalities define facets of the asymmetric traveling salesman polytope , 1995 .

[18]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[19]  Matteo Fischetti,et al.  A Polyhedral Approach to the Asymmetric Traveling Salesman Problem , 1997 .

[20]  Anna Sciomachen,et al.  A mixed-integer model for solving ordering problems with side constraints , 1997, Ann. Oper. Res..

[21]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

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

[23]  E. Balas On the facial structure of scheduling polyhedra , 1985 .

[24]  Gilbert Laporte,et al.  Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..

[25]  Mwp Martin Savelsbergh,et al.  VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .

[26]  Martin Grötschel,et al.  Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme , 1977 .

[27]  Martin Grötschel,et al.  A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) , 1993, SIAM J. Optim..

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

[29]  Maurice Queyranne,et al.  Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes , 1995, Math. Oper. Res..

[30]  Giovanni Rinaldi,et al.  The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities , 1996, SIAM J. Discret. Math..

[31]  Martin Grötschel,et al.  Order picking in an automatic warehouse: Solving online asymmetric TSPs , 1999, Math. Methods Oper. Res..