Good triangulations yield good tours

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. Scope and Purpose: The Traveling Salesman Problem (TSP) is a fundamental and well-known problem in combinatorial optimisation. It has many applications, for example in vehicle routing and machine scheduling. This paper proposes several heuristics methods for the Euclidean TSP, based on the use of triangulations, and gives extensive computational results.

• Type: Journal
• Year: 2008
• Where: COR
• Authors: Adam N. Letchford, Nicholas A. Pearson
• Keywords: COR 2008, Planar Euclidean Instances, Planar Graph, Traveling Salesman Problem