Letchford, A N and Pearson, N (2008) Good triangulations yield good tours. Computers and Operations Research, 35 (2). pp. 638-647. ISSN 0305-0548
![[img]](http://eprints.lancs.ac.uk/style/images/fileicons/application_pdf.png)
| PDF (Good triangulations yield good tours) - Draft Version Download (165Kb) | Preview |
Official URL: http://dx.doi.org/10.1016/j.cor.2006.03.025
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.
| Item Type: | Article |
|---|---|
| Journal or Publication Title: | Computers and Operations Research |
| Uncontrolled Keywords: | Delaunay triangulation ; traveling salesman problem |
| Subjects: | H Social Sciences > HB Economic Theory |
| Departments: | Lancaster University Management School > Management Science |
| ID Code: | 44518 |
| Deposited By: | ep_importer_pure |
| Deposited On: | 11 Jul 2011 19:17 |
| Refereed?: | Yes |
| Published?: | Published |
| Last Modified: | 06 Feb 2013 16:45 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/44518 |
Actions (login required)
| View Item |
