A heuristic for the asymmetric traveling salesman problem
Janez Brest and Janez Žerovnik
The 6th Metaheuristics International Conference
University of Vienna
ISBN proceedings on CD-rom
In this note we first give the results of tests of our algorithm on all ATSP instances of the TSPLIB library, which were available at the time of the experiment. The results we obtain are consistent with our experience with insertion--and--optimization approach on PTSP, a probabilistic generalization of TSP. While the quality of results is comparable with our earlier tests, the running times are now much shorter. Bearing in mind high inherent paralelism of the heuristics, we claim that the approach we use may indeed be
useful. Finally, we give upper bounds for the approximation ratio of a variant of our heuristics which depends on the "asymmetry" of the instance.