Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

0.00 Avg rating0 Votes
Article ID: iaor1989706
Country: Netherlands
Volume: 8
Issue: 3
Start Page Number: 129
End Page Number: 135
Publication Date: Jun 1989
Journal: Operations Research Letters
Authors: ,
Keywords: programming: travelling salesman
Abstract:

Computational results are presented for a parallel branch and bound algorithm that optimally solves the asymmetric traveling salesman problem. The algorithm uses an assignment problem based lower bounding technique, subtour elimination branching rules, and a subtour patching algorithm as an upper bounding procedure. Results are presented for randomly generated problems with sizes ranging from 50 to 3000 cities.

Reviews

Required fields are marked *. Your email address will not be published.