How To Make a Greedy Heuristic for the Asymmetric Traveling Salesman Problem Competitive
2005 (English)Report (Refereed)
It is widely confirmed by many computational experiments that a greedy type heuristics for the Traveling Salesman Problem (TSP) produces rather poor solutions except for the Euclidean TSP. The selection of arcs to be included by a greedy heuristic is usually done on the base of cost values. We propose to use upper tolerances of an optimal solution to one of the relaxed Asymmetric TSP (ATSP) to guide the selection of an arc to be included in the final greedy solution. Even though it needs time to calculate tolerances, our computational experiments for the wide range of ATSP instances show that tolerance based greedy heuristics is much more accurate and faster than previously reported greedy type algorithms.
Place, publisher, year, edition, pages
Groningen: University Groningen, The Netherlands , 2005. , 16 p.
, SOM (Systems, Organisations and Management) Research Report, 05A11
IdentifiersURN: urn:nbn:se:umu:diva-83146OAI: oai:DiVA.org:umu-83146DiVA: diva2:665169