×

The TSP and the sum of its marginal values. (English) Zbl 1103.90083

Summary: 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 \in I\) is the difference between the length of the optimal tour on \(I\) and the length of the optimal tour on \(I\setminus 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 \(L_{1}\) metric. We also compute the TSP ratio experimentally for a large number of random TSP instances on small number of points.

MSC:

90C27 Combinatorial optimization
90C11 Mixed integer programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Gutin G., Traveling Salesman Problem and Its Variations (2002) · Zbl 0996.00026
[2] DOI: 10.1007/978-1-349-03521-2 · Zbl 1226.05083 · doi:10.1007/978-1-349-03521-2
[3] DOI: 10.1016/0012-365X(74)90074-0 · Zbl 0278.05110 · doi:10.1016/0012-365X(74)90074-0
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.