Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut (original) (raw)

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.

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

1. Intranetz GmbH, Bergstr. 22, 10115 Berlin, Germany, http://www.intranetz.de, , , , , , DE
   Norbert Ascheuer
2. Dipartimento di Elettronica ed Informatica, University of Padova, Italy (work supported by C.N.R., Italy), , , , , , IT
   Matteo Fischetti
3. Konrad–Zuse–Zentrum für Informationstechnik Berlin (ZIB), Takustr. 7, 14195 Berlin–Dahlem, Germany, http://www.zib.de, , , , , , DE
   Martin Grötschel

Authors

1. Norbert Ascheuer
2. Matteo Fischetti
3. Martin Grötschel

Additional information

Received: August 1999 / Accepted: September 2000¶Published online April 12, 2001

Rights and permissions

About this article

Cite this article

Ascheuer, N., Fischetti, M. & Grötschel, M. Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut.Math. Program. 90, 475–506 (2001). https://doi.org/10.1007/PL00011432

Download citation

• Issue date: May 2001
• DOI: https://doi.org/10.1007/PL00011432