Exact solution of large asymmetric travelling salesman problems

Exact solution of large asymmetric travelling salesman problems

0.00 Avg rating0 Votes
Article ID: iaor19941968
Country: United States
Volume: 251
Issue: 4995
Start Page Number: 754
End Page Number: 761
Publication Date: Feb 1991
Journal: Science
Authors: ,
Abstract:

The travelling salesman problem is one of a class of difficult problems in combinatorial optimization that is representative of a large number of important scientific and engineering problems. A survey is given of recent applications and methods for solving large problems. In addition, an algorithm for the exact solution of the large asymmetric travelling salesman problem is presented along with computational results for several classes of problems. The results show that the algorithm performs remarkably well for some classes of problems, determining an optimal solution even for problems with large numbers of cities, yet for other classes, even small problems thwart determination of a provably optimal solution.

Reviews

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