G. Carpaneto
Abstract
A lowest-first, branch-and-bound algorithm for the Asymmetric Traveling Salesman Problem is presented. The method is based on the Assignment Problem relaxation and on a subtour elimination branching scheme. The effectiveness of the algorithm derives from reduction procedures and parametric solution of the relaxed problems associated with the nodes of the branch-decision tree. Large-size, uniformly, randomly generated instances of complete digraphs with up to 2000 vertices are solved on a DECstation 5000/240 computer in less than 3 minutes of CPU time. In addition, we solved on a PC 486/33 no wait flow shop problems with up to 1000 jobs in less than 11 minutes and real-world stacker crane problems with up to 443 movements in less than 6 seconds.
Get full access to this article
Purchase, subscribe or recommend this article to your librarian.
Already a Subscriber?Sign In
References
- BALAS, E. AND CHRISTOFIDES, N. 1981. A restricted Lagrangean approach to the travelling salesman problem. Math. Program. 21, 19-46.Google Scholar
- BALAS, E. AND TOTH, P. 1985. Branch and bound methods for the travelling salesman problem. In The Traveling Salesman Problem, G. Lawler, J. K. Lenstra, A. Rinnooy Kan, and D. Shmoys, Eds. John Wiley, New York, 361-401.Google Scholar
- BELLMORE, M. AND MALONE, J. C. 1971. Pathology of traveling salesman subtour elimination algorithms. Oper. Res. 19,278-307.Google Scholar
- CARPANETO, G. AND TOTH, P. 1980. Some new branching and bounding criteria for the asymmetric travelling salesman problem. Manage. Sci. 26, 736 743.Google Scholar
- CARPANETO, G. AND TOTH P.1987. Primal-dual algorithms for the assignment problem. Dzscr. Appl. Math. 18, 137-153.Google Scholar
- CARPANETO, G., DELL'AMIcO, M., AND TOTH, P. 1989. Ricerca di percorm Hamiltoniani in graft orientati di grandi dimensioni. In the 13th AMASES Conference (Verona, Italy).Google Scholar
- CARPANETO, G., DELL'AMICO, M., AND TOTH, P. 1995. Algorithm 750: CDT: A subroutine for the exact solution of large-scale, asymmetric traveling salesman problems. ACM Trans. Math. Softw. 21, 4 (Dec.). This issue.
Google Scholar - JOHNSON, D.B. 1977. Efficient algorithms for shortest paths in sparse networks. J. ACM 24, 1-13.
Google Scholar - KARP, R.M. 1979. A patching algorithm for the nonsymmetric traveling salesman problem SIAM J. Comput. 8, 561-573.Google Scholar
- MILLER, D. L. AND PEKNY, J.F. 1989. Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem. Oper. Res Lett. 8, 129-135.Google Scholar
- MILLER, D. L. AND PEKNY, J.F. 1991. Exact solution of large asymmetric traveling salesman problems. Science 251,754-761.Google Scholar
- PADBERG, M. AND RINALDI, G. 1991. A branch-and-cut algorithm for the resolution of large scale symmetric traveling salesman problems. SIAM Rev. 33, 60-100.
Google Scholar - PAPADIMITRIOU, C. J. AND KANELLAKIS, P.C. 1980. Flowshop scheduling with limited temporary storage. J. ACM 27, 533 549.
Google Scholar - PEKNY, J. F., MILLER, D. L., AND STODOLSKY, D. 1991. A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem. Oper. Res. Lett. 10, 173-176.Google Scholar
- PEKNY, J. F. AND MILLER, D.L. 1992. A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. Math. Program. 55, 17-33.
Google Scholar - SMITH, T. H. C., SRINIVASAN, V., AND THOMPSON, G.L. 1977. Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems. Ann. Dtscr. Moth. 1, 495-506.Google Scholar
Index Terms
Exact solution of large-scale, asymmetric traveling salesman problems
Comments