Good triangulations yield good tour

Good triangulations yield good tour

0.00 Avg rating0 Votes
Article ID: iaor2009696
Country: United Kingdom
Volume: 35
Issue: 2
Start Page Number: 638
End Page Number: 647
Publication Date: Feb 2008
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics
Abstract:

Consider the following heuristic for planar Euclidean instances of the traveling salesman problem (TSP): select a subset of the edges which induces a planar graph, and solve either the TSP or its graphical relaxation on that graph, In this paper, we give several motivations for considering this heuristic, along with extensive computational results. It turns out that the Delaunay and greedy triangulations make effective choices for the induced planar graph. Indeed, our experiments show that the resulting tours are on average within 0.1% of optimality.

Reviews

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