A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems

1992 ◽  
Vol 55 (1-3) ◽  
pp. 17-33 ◽  
Author(s):  
J. F. Pekny ◽  
D. L. Miller
Keyword(s):  
Branch And Bound ◽  
Traveling Salesman ◽  
Branch And Bound Algorithm ◽  
Traveling Salesman Problems ◽  
Parallel Branch And Bound

Implementing Parallel Branch-and-Bound with Extended Sisal 2.0

1998 ◽  
Vol 08 (01) ◽  
pp. 41-50
Author(s):  
Yung-Syau Chen ◽  
Jean-Luc Gaudiot
Keyword(s):  
Traveling Salesman Problem ◽  
Branch And Bound ◽  
Optimization Technique ◽  
Traveling Salesman ◽  
Functional Language ◽  
Global Variables ◽  
Parallel Version ◽  
Parallel Branch And Bound ◽  
Hard Problems ◽  
The Traveling Salesman Problem

Parallel branch-and-bound is an optimization technique which renders more efficient the solution of some hard problems such as the puzzle of colored blocks and the traveling-salesman problem. In a functional language such as Sisal 2.0, it is difficult for the programmer to describe a parallel version of this technique due to the lack of imperative features in the language. In this paper, we propose a version of Sisal 2.0 extended with user-declared mutable global variables in order to enable Sisal programmers to apply the parallel branch-and-bound technique. In a simple example (the puzzle of colored blocks), we show that this approach yields better performance than either conventional functional programs or imperative programs. It is easy to see that the same strategy can be used to solve a number of hard problems such as the traveling-salesman problem.

Sign in / Sign up

Export Citation Format

Share Document