Good triangulations yield good tours

Letchford, A N and Pearson, N (2008) Good triangulations yield good tours. Computers and Operations Research, 35 (2). pp. 638-647. ISSN 0305-0548

PDF (Good triangulations yield good tours)
10.pdf - Submitted Version

Download (169kB)


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.

Item Type: Journal Article
Journal or Publication Title: Computers and Operations Research
Uncontrolled Keywords: /dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Departments: Lancaster University Management School > Management Science
ID Code: 44518
Deposited By: ep_importer_pure
Deposited On: 11 Jul 2011 18:17
Refereed?: Yes
Published?: Published
Last Modified: 15 Oct 2019 23:32

Actions (login required)

View Item View Item