Gutin, Gregory, Yeo, Anders and Zverovitch, A. (2002) Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Applied Mathematics, 117 (1-3).
Full text access: Open
Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN), popular choices for tour construction heuristics, work at acceptable level for the Euclidean TSP, but produce very poor results for the general Symmetric and Asymmetric TSP (STSP and ATSP). We prove that for every n2 there is an instance of ATSP (STSP) on n vertices for which GR finds the worst tour. The same result holds for NN. We also analyze the repetitive NN (RNN) that starts NN from every vertex and chooses the best tour obtained. We prove that, for the ATSP, RNN always produces a tour, which is not worse than at least n/2ā1 other tours, but for some instance it finds a tour, which is not worse than at most nā2 other tours, n4. We also show that, for some instance of the STSP on n4 vertices, RNN produces a tour not worse than at most 2nā3 tours. These results are in sharp contrast to earlier results by Gutin and Yeo, and Punnen and Kabadi, who proved that, for the ATSP, there are tour construction heuristics, including some popular ones, that always build a tour not worse than at least (nā2)! tours.
This is a Submitted version This version's date is: 2002 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/f7377647-831d-8a50-338c-a8fae90305b4/5/
Deposited by Research Information System (atira) on 03-Jul-2014 in Royal Holloway Research Online.Last modified on 03-Jul-2014