论文信息 - Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound Algorithm

Solving Traveling Salesman Problems Using a Parallel Synchronized Branch and Bound Algorithm

In this paper we describe an efficient parallel synchronized branch and bound (PSBB) algorithm for distributed memory parallel computers. The parallelization of the sequential best-first branch and bound algorithm is based on the concept of alternating computation and synchronization steps. The computational steps simplify the problem to solve whereas the synchronization phases solve the problem of load balancing and data distribution. Experimental results show the efficiency of the proposed PSBB algorithm when solving traveling salesman problems on a massively parallel Cray T3D machine.

Marc Gengler | Claude G. Diderich

[1] S. Ubeda,et al. An efficient algorithm for solving the token distribution problem on k-ary d-cube networks , 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] R. Jonker,et al. The symmetric traveling salesman problem and edge exchanges in minimal 1-trees , 1983 .

[4] F. A. Seiler,et al. Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[5] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .

[6] Giovanni Coray,et al. A Parallel Best-first B&B Algorithm and its Axiomatization , 1994, Parallel Algorithms Appl..

[7] Eugene L. Lawler,et al. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization , 1985 .

[8] R. Jonker,et al. A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation , 1982 .

[9] L. G. Mitten. Branch-and-Bound Methods: General Formulation and Properties , 1970, Oper. Res..