On Asymmetric TSP: Transformation to Symmetric TSP and Performance Bound
Download:
|
|
by Ratnesh Kumar, Haomin Li
http://www.engr.uky.edu/~kumar/PUBS/atsp.ps
Add To MetaCart
Abstract:
We show that an instance of traveling salesman problem (TSP) of size n with an asymmetric distance matrix can be transformed into an instance of TSP of size 2n with a symmetric distance matrix. This is an improvement over earlier transformations of this kind which triple the size of the problem. Next we use this transformation to obtain a Hamiltonian tour of a general TSP (which may be asymmetric and/or nonEucledian) with the worst case performance ratio of 20 9 when the ratio fl:= dmax dmin is smaller than 4 3, and (
Citations
| 7715 | Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979 |
| 273 | The Traveling Salesman problem – Lawler, Lenstra - 1984 |
| 58 | Discrete Optimization – Parker, Rardin - 1988 |
| 47 | On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks – Frieze, Galbiati, et al. - 1982 |
| 22 | Local search for the asymmetric traveling salesman problem – Kanellakis, Papadimitriou - 1980 |
| 2 | Assembly time optimization for pcb assembly – Kumar, Li - 1994 |
| 2 | Integer programming based approach to printed ciruit board assembly time optimization – Kumar, Li - 1995 |
