The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests

ALENEX, pp. 32-59, 2001.

Cited by: 172|Bibtex|Views12
EI
Other Links: dblp.uni-trier.de|dl.acm.org|academic.microsoft.com

Abstract:

The purpose of this paper is to provide a preliminary report on the first broad-based experimental comparison of modern heuristics for the asymmetric traveling salesmen problem (ATSP). There are currently three general classes of such heuristics: classical tour construction heuristics such as Nearest Neighbor and the Greedy algorithm, loc...More

Code:

Data:

Your rating :
0

 

Tags
Comments