Konrad-zuse-zentrum F ¨ Ur Informationstechnik Berlin Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut Solving the Asymmetric Travelling Salesman Problem with Time Windows by Branch-and-cut

Abstract.Many optimization problems have several equivalent mathematical models. It is often not apparent which of these models is most suitable for practical computation, in particular, when a certain application with a specific range of instance sizes is in focus. Our paper addresses the Asymmetric Travelling Salesman Problem with time windows (ATSP-TW) from such a point of view. The real–world application we aim at is the control of a stacker crane in a warehouse.¶We have implemented codes based on three alternative integer programming formulations of the ATSP-TW and more than ten heuristics. Computational results for real-world instances with up to 233 nodes are reported, showing that a new model presented in a companion paper outperforms the other two models we considered – at least for our special application – and that the heuristics provide acceptable solutions.

[1]  Enrico Tronci.  1997 , 1997, Les 25 ans de l’OMC: Une rétrospective en photos.

[2]  M M Solomon,et al.  VEHICLE ROUTING AND SCHEDULING PROBLEMS WITH TIME WINDOW CONSTRAINTS: EFFICIENT IMPLEMENTATIONS OF SOLUTION IMPROVEMENT PROCEDURES , 1988 .

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

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

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

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

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

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

[9]  Bruce L. Golden,et al.  VEHICLE ROUTING: METHODS AND STUDIES , 1988 .

[10]  Michael Jünger,et al.  Introduction to ABACUS - a branch-and-cut system , 1998, Oper. Res. Lett..

[11]  Matteo Fischetti,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000, Networks.

[12]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..

[13]  Giovanni Rinaldi,et al.  An efficient algorithm for the minimum capacity cut problem , 1990, Math. Program..

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

[15]  Lucio Bianco,et al.  Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints , 1997, Oper. Res..

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

[17]  Michael Jünger,et al.  Provably good solutions for the traveling salesman problem , 1994, Math. Methods Oper. Res..

[18]  B. Müller,et al.  Solution of the Traveling-Salesman Problem , 1995 .

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

[20]  BalasEgon,et al.  Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs , 2000 .

[21]  Martin Grötschel,et al.  Combinatorial Online Optimization , 1999 .

[22]  Stefan Thienel,et al.  ABACUS - a branch-and-CUt system , 1995 .

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

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

[25]  M. Grötschel,et al.  A polyhedral study of the asymmetric traveling salesman problem with time windows , 2000 .

[26]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[27]  Robert Bixby,et al.  On the Solution of Traveling Salesman , 1998 .

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

[29]  Giovanni Rinaldi,et al.  A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems , 1991, SIAM Rev..

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

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

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

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

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

[35]  Gerhard Reinelt,et al.  Traveling salesman problem , 2012 .

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

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

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

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

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

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

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

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