Abstract
A parallel branch and bound algorithm that solves the asymmetric traveling salesman problem to optimality is described. The algorithm uses an assignment problem based lower bounding technique, subtour elimination branching rules, and a subtour patching algorithm as an upper bounding procedure. The algorithm is organized around a data flow framework for parallel branch and bound. The algorithm begins by converting the cost matrix to a sparser version in such a fashion as to retain the optimality of the final solution. Computational results are presented for three different classes of problem instances: (1) matrix elements drawn from a uniform distribution of integers for instances of size 250 to 10 000 cities, (2) instances of size 250 to 1000 cities that concentrate small elements in the upper left portion of the cost matrix, and (3) instances of size 300 to 3000 cities that are designed to confound neighborhood search heuristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Balas, D.L. Miller, J.F. Pekny and P. Toth, “A parallel shortest path algorithm for the assignment problem,”Journal of the Association for Computing Machinery 38 (1991) 985–1004.
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).
D.P. Bertsekas and D.A. Castanon, “Parallel synchronous and asynchronous implementations of the auction algorithm,” Working Paper, Department of Electrical Engineering and Computer Science, M.I.T. (Cambridge, MA, 1989).
B. Carnahan, H.A. Luther and J.O. Wilkes,Applied Numerical Methods (Wiley, New York, 1969).
G. Carpaneto and P. Toth, “Some new branching and bounding criteria for the asymmetric travelling salesman problem,”Management Science 26 (1980) 736–743.
G. Carpaneto and P. Toth, “Primal—dual algorithms for the assignment problem,”Discrete Applied Mathematics 18 (1987) 137–153.
G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963).
G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “Solution of a large-scale traveling salesman problem,”Operations Research 2 (1954) 393–410.
G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, “On a linear-programming, combinatorial approach to the traveling salesman problem,”Operations Research 7 (1959) 58.
E.W. Dijkstra, “A note on two problems in connexion with graphs,”Numerische Mathematik 1 (1959) 269–271.
O.I. El-Dessouki and W.H. Huen, “Distributed enumeration on between computers,”IEEE Transactions on Computers C-29 (1980) 818–825.
M. Fischetti and P. Toth, “An additive bounding procedure for combinatorial optimization problems,”Operations Research 37 (1989) 319–328.
K. Hwang and F.A. Briggs,Computer Architecture and Parallel Processing (McGraw-Hill, New York, 1984).
R.M. Karp, “A patching algorithm for the nonsymmetric travelling salesman problem,”Siam Journal on Computing 8 (1979) 561–573.
G.A.P. Kindervater and J.K. Lenstra, “Parallel algorithms” in: M. O'hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization: Annotated Bibliographies (Wiley, Chichester, 1985) pp. 106–128.
T.H. Lai and S. Sahni, “Anomalies in parallel branch-and-bound algorithms,”Communications of the ACM 27 (1984) 594–602.
T. Lai and A. Sprague, “A note on anomalies in parallel branch-and-bound algorithms with one-to-one bounding function,”Information Processing Letters 23 (1986) 119–122.
I. Lavallee and C. Roucairol, “Parallel branch and bound algorithms,” MASI Research Report EURO VII (1985).
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).
G. Li and B.W. Wah, “Computational efficiency of parallel approximate branch-and-bound algorithms,”International Conference on Parallel Processing (1984) 473–480.
J.D.C. Little, K.G. Murty, D.W. Sweeney and C. Karel, “An algorithm for the traveling salesman problem,”Operations Research 11 (1963) 972–989.
S. Martello and P. Toth, “Linear assignment problems,”Annals of Discrete Mathematics 31 (1987) 259–282.
D.L. Miller and J.F. Pekny, “Results from a parallel branch and bound algorithm for solving large asymmetric traveling salesman problems,”Operations Research Letters 8 (1989) 129–135.
J. Mohan, “Experience with two parallel programs solving the traveling salesman problem,”IEEE International Conference on Parallel Processing (1983) 191–193.
M. Padberg and G. Rinaldi, “Optimization of a 532-city symmetric traveling salesman problem by branch and cut,”Operations Research 6 (1987) 1–7.
C.H. Papadimitrou and K. Steiglitz, “Some examples of difficult traveling salesman problems,”Operations Research 26 (1978) 434–443.
E.A. Pruul, G.L. Nemhauser and R.A. Rushmeier, “Branch-and-bound and parallel computations: a historical note,”Operations Research 7 (1988) 65–69.
R. Rettberg and R. Thomas, “Contention is no obstacle to shared memory multiprocessing,”Communications of the ACM 29 (1986) 1202–1212.
C.C. Ribeiro, “Parallel computer models and combinatorial algorithms,”Annals of Discrete Mathematics 31 (1987) 325–364.
R.E. Tarjan,Data Structures and Network Algorithms (Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pekny, J.F., Miller, D.L. A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems. Mathematical Programming 55, 17–33 (1992). https://doi.org/10.1007/BF01581188
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581188