Abstract
Although the m-ATSP (or multi traveling salesman problem) is well known for its importance in scheduling and vehicle routing, it has, to the best of our knowledge, never been studied polyhedraly, i.e., it has always been transformed to the standard ATSP. This transformation is valid only if the cost of an arc from node i to node j is the same for all machines. In many practical applications this is not the case, machines produce with different speeds and require different (usually sequence dependent) setup times. We present first results of a polyhedral analysis of the m-ATSP in full generality. For this we exploit the tight relation between the subproblem for one machine and the prize collecting traveling salesman problem. We show that, for m ≥ 3 machines, all facets of the one machine subproblem also define facets of the m-ATSP polytope. In particular the inequalities corresponding to the subtour elimination constraints in the one machine subproblems are facet defining for m-ATSP for m ≥ 2 and can be separated in polynomial time. Furthermore, they imply the subtour elimination constraints for the ATSP-problem obtained via the standard transformation for identical machines. In addition, we identify a new class of facet defining inequalities of the one machine subproblem, that are also facet defining for m-ATSP for m ≥ 2. To illustrate the efficacy of the approach we present numerical results for a scheduling problem with non-identical machines, arising in the production of gift wrap at Herlitz PBS AG.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E. Balas. The prize collecting traveling salesman problem. Networks, 19:621–636, 1989.
E. Balas. The prize collecting traveling salesman problem: II. polyhedral results. Networks, 25:199–216, 1995.
E. Balas and M. Fischetti. A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets. Mathematical Programming, 58:325–352, 1993.
M._O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, editors. Network Routing, volume 8 of Handbooks in Operations Research and Management Science. Elsevier Sci. B.V., Amsterdam, 1995.
J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis. Time Constrained Routing and Scheduling, chapter 2, pages 35–139. Volume 8 of Ball et al. [4], 1995.
M. Fischetti, J. Salazar González, and P. Toth. A branch-and-cut algorithm for the generalized travelling salesman problem. Technical report, University of Padova, 1994.
M. Fischetti and P. Toth. A polyhedral approach to the asymmetric traveling salesman problem. Management Science, 43:1520–1536, 1997.
M. Fischetti and P. Toth. An additive approach for the optimal solution of the prize-collecting travelling salesman problem. In B. Golden and A. Assad, editors, Vehicle Routing: Methods and Studies, pages 319–343. Elsevier Science Publishers B.V. (North-Holland), 1998.
M. Gendreau, G. Laporte, and F. Semet. A branch-and-cut algorithm for the undirected selective traveling salesman problem. Networks, 32:263–273, 1998.
M. Grötschel and M. Padberg. Polyhedral theory. In [12], chapter 8.
M. Jünger, G. Reinelt, and G. Rinaldi. The traveling salesman problem. In M. Ball, T. Magnanti, C. Monma, and G. Nemhauser, editors, Network Models, volume 7 of Handbooks in Operations Research and Management Science, chapter 4, pages 225–330. North Holland, 1995.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors. The Traveling Salesman Problem. John Wiley & Sons Ltd, Chichester, 1985.
M. Padberg and M. Grötschel. Polyhedral computations. In [12], chapter 9.
M. Padberg and G. Rinaldi. Facet identification for the symmetric traveling salesman polytope. Mathematical Programming, 47:219–257, 1990.
M. Padberg and G. Rinaldi. A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Review, 33:60–100, 1991.
G. Reinelt. The traveling salesman-Computational solutions for TSP applications. Number 840 in Lecture Notes in Computer Science. Springer-Verlag, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Helmberg, C. (1999). The m-Cost ATSP. In: Cornuéjols, G., Burkard, R.E., Woeginger, G.J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1999. Lecture Notes in Computer Science, vol 1610. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48777-8_19
Download citation
DOI: https://doi.org/10.1007/3-540-48777-8_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66019-4
Online ISBN: 978-3-540-48777-7
eBook Packages: Springer Book Archive