12,000

We have over 12,000 students, from over 100 countries, within one of the safest campuses in the UK

97%

97% of Lancaster students go into work or further study within six months of graduating

Home > Research > Publications & Outputs > Good triangulations yield good tours
View graph of relations

« Back

Good triangulations yield good tours

Research output: Contribution to journalJournal article

Published

<mark>Journal publication date</mark>2008
<mark>Journal</mark>Computers and Operations Research
Issue2
Volume35
Number of pages10
Pages638-647
<mark>Original language</mark>English

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.

Related projects