Abstract
In this paper, new lower bounds for the asymmetric travelling salesman problem are presented, based on spanning arborescences. The new bounds are combined in an additive procedure whose theoretical performance is compared with that of the Balas and Christofides procedure (1981). Both procedures have been imbedded in a simple branch and bound algorithm and experimentally evaluated on hard test problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas and N. Christofides, “A restricted Lagrangean approach to the traveling salesman problem,”Mathematical Programming 21 (1981) 19–46.
E. Balas and P. Toth, “Branch and bound methods,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).
M. Bellmore and J.C. Malone, “Pathology of traveling salesman subtour elimination algorithms,”Operations Research 19 (1971) 278–307.
P.M. Camerini, L. Fratta and F. Maffioli, “A note on finding optimum branchings,”Networks 9 (1979) 309–312.
P.M. Camerini, L. Fratta and F. Maffioli, “Thek best spanning arborescences of a network,”Networks 10 (1980) 91–110.
G. Carpaneto, M. Dell'Amico, M. Fischetti and P. Toth, “A branch and bound algorithm for the multiple depot vehicle scheduling problem,”Networks 19 (1989) 531–548.
G. Carpaneto, M. Fischetti and P. Toth, “New lower bounds for the symmetric travelling salesman problem,”Mathematical Programming (Series B) 45 (1989) 233–254.
G. Carpaneto, S. Martello and P. Toth, “Algorithms and codes for the assignment problem,”Annals of Operations Research 7 (1988).
G. Carpaneto and P. Toth, “Some new branching and bounding criteria for the asymmetric travelling salesman problem,”Management Science 26 (1980) 736–743.
N. Christofides, “Bounds for the traveling salesman problem,”Operations Research 20 (1972) 1044–1056.
J. Edmonds, “Optimum branchings,”Journal of Research of the National Bureau of Standards-B. Mathematics and Mathematical Physics 71B (1967) 233–240.
M. Fischetti and P. Toth, “An efficient algorithm for the min-sum arborescence problem,” Technical Report OR/87/6, DEIS, University of Bologna (Bolonga, 1987).
M. Fischetti and P. Toth, “An additive approach for the optimal solution of the prize-collecting travelling salesman problem,” in: B.L. Golden and A.A. Assad, eds.,Vehicle Routing: Methods and Studies (North-Holland, Amsterdam, 1988).
M. Fischetti and P. Toth, “An additive bounding procedure for combinatorial optimization problems,”Operations Research 37 (1989) 319–328.
D.R. Fulkerson, “Packing rooted directed cuts in a weighted directed graph,”Mathematical Programming 6 (1974) 1–13.
M. Grötschel and M.W. Padberg, “Polyhedral theory,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).
M. Held and R.M. Karp, “The traveling-salesman problem and minimum spanning tress: Part II,”Mathematical Programming 1 (1971) 6–25.
G.A.P. Kindervater, A. Volgenant, G. de Leve and V. van Gijlswijk, “On dual solutions of the linear assignment problem,”European Journal of Operational Research 19 (1985) 76–81.
P.D. Krolak, W. Felts and G. Marble, “A man-machine approach toward solving the traveling salesman problem,”Communications of the Association on Computing Machinery 14 (1971) 327–334.
E.L. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).
M.W. Padberg and M. Grötschel, “Polyhedral computations,” in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan and D.B. Shmoys, eds.,The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization (Wiley, New York, 1985).
G. Rinaldi and L.A. Yarrow, “Optimizing a 48-city traveling salesman problem: A case study in combinatorial problem solving,” Preprint R. 122, IASI-CNR (Rome, 1985).
T.H.C. Smith, V. Srinivasan and G.L. Thompson, “Computational performance of three subtour elimination algorithms for solving asymmetric traveling salesman problems,”Annals of Discrete Mathematics 1 (1977) 479–493.
R.E. Tarjan, “Depth-first search and linear algorithms,”SIAM Journal on Computing 1 (1972) 146–160.
R.E. Tarjan, “Finding optimum branchings,”Networks 7 (1977) 25–35.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Fischetti, M., Toth, P. An additive bounding procedure for the asymmetric travelling salesman problem. Mathematical Programming 53, 173–197 (1992). https://doi.org/10.1007/BF01585701
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01585701