Abstract
This paper introduces a new notion related to the traveling salesperson problem (TSP) — the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal values of the nodes of I divided by the length of the optimal TSP tour on I, where the marginal value of a node i ∈ I is the difference between the length of the optimal tour on I and the length of the optimal tour on I\i. We consider the problem of establishing exact upper and lower bounds on the TSP ratio. To our knowledge, this problem has not been studied previously. We present a number of cases for which the ratio is never greater than 1. We establish a tight upper bound of 2 on the TSP ratio of any metric TSP. For the TSP on six nodes, we determine the maximum ratio of 1.5 in general, 1.2 for the case of metric TSP, and 10/9 for the geometric TSP in the L1 metric. We also compute the TSP ratio experimentally for a large number of random TSP instances on small number of points.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computational Geometry & Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
