Computing compatible tours for the traveling salesman problem

Fortini, M and Letchford, A N and Lodi, A and Wenger, K M (2011) Computing compatible tours for the traveling salesman problem. Mathematical Programming Computation, 3 (1). pp. 59-78. ISSN 1867-2957

[img]
Preview
PDF (Computing compatible tours for the traveling salesman problem)
10.pdf - Submitted Version

Download (425kB)

Abstract

We consider the following natural heuristic for the Symmetric Traveling Salesman Problem: solve the subtour relaxation, yielding a solution x*, and then find the best tour x-bar that is 'compatible' with x*, where compatible means that every subtour elimination constraint that is satisfied at equality at x* is also satisfied at equality at x-bar. We prove that finding the best compatible tour is NP-hard and show that the tour can have a cost approaching 5/3 that of the optimal tour. We then describe a branch-and-cut algorithm for computing the best compatible tour, and present extensive computational results for TSPLIB instances. It turns out that, in practice, the tour is usually of very good quality. Moreover, the computational effort for computing the compatible tour is considerably smaller than that of solving the full problem with the best available software, i.e., Concorde.

Item Type:
Journal Article
Journal or Publication Title:
Mathematical Programming Computation
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/aacsb/disciplinebasedresearch
Subjects:
ID Code:
45768
Deposited By:
Deposited On:
11 Jul 2011 18:37
Refereed?:
Yes
Published?:
Published
Last Modified:
26 May 2020 02:32