For a convex body B in a vector space V, we construct its approximation P_k, k=1, 2, . . . using an intersection of a cone of positive semidefinite quadratic forms with an affine subspace. We show that P_k is contained in B for each k. When B is the Symmetric Traveling Salesman Polytope on n cities T_n, we show that the scaling of P_k by n/k+ O(1/n) contains T_n for k no more than n/2. Membership for P_k is computable in time polynomial in n (of degree linear in k).
We discuss facets of T_n that lie on the boundary of P_k. We introduce a new measure on each facet defining inequality for T_n in terms of the eigenvalues of a quadratic form. Using these eigenvalues of facets, we show that the scaling of P_1 by n^(1/2) has all of the facets of T_n defined by the subtour elimination constraints either in its interior or lying on its boundary.
For the Traveling Salesman Polytope on n cities T_n, we construct its approximation Q_k, k=1, 2, . . ., n^(1/3) using a projection of a polytope whose number of facets is polynomial in n (of degree linear in k). We show that T_n is contained in Q_k for each k, and that the scaling of Q_k by k/n+O(1/n) is contained in T_n for each k. We show that certain facets of T_n lie on the boundary of Q_k.
In this short communication, we observe that the Graphical Traveling Salesman Polyhedron is the intersection of the positive orthant with the Minkowski sum of the Symmetric Traveling Salesman Polytope and the polar of the metric cone. This follows almost trivially from known facts. There are two reasons why we find this observation worth communicating none-the-less: It is very surprising; it helps to understand the relationship between these two important families of polyhedra.
The Symmetric Traveling Salesman Polytope $S_n$ for a fixed number $n$ of cities is a face of the corresponding Graphical Traveling Salesman Polyhedron $P_n$. This has been used to study facets of $S_n$ using $P_n$ as a tool. In this paper, we study the operation of "rotating" (or "lifting") valid inequalities for $S_n$ to obtain a valid inequalities for $P_n$. As an application, we describe a surprising relationship between (a) the parsimonious property of relaxations of the Symmetric Traveling Salesman Polytope and (b) a connectivity property of the ridge graph of the Graphical Traveling Sal…
We present tight upper and lower bounds for the traveling salesman path through the points of two-dimensional modular lattices. We use these results to bound the traveling salesman path of two-dimensional Kronecker point sets. Our results rely on earlier work on shortest vectors in lattices as well as on the strong convergence of Jacobi-Perron type algorithms.
We prove that the approximation ratio of the greedy algorithm for the metric Traveling Salesman Problem is $Θ(\log n)$. Moreover, we prove that the same result also holds for graphic, Euclidean, and rectilinear instances of the Traveling Salesman Problem. Finally we show that the approximation ratio of the Clarke-Wright savings heuristic for the metric Traveling Salesman Problem is $Θ(\log n)$.
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP) that may be obtained via an SDP relaxation of the more general quadratic assignment problem (QAP). We show that the new relaxation dominates the one in [D. Cvetkovic, M. Cangalovic, and V. Kovacevic-Vujcic, Semidefinite programming methods for the symmetric traveling salesman problem, in Proc. 7th Int. IPCO Conference, Springer, London, 1999, pp. 126--136]. Unlike the bound of Cvetkovic et al., the new SDP bound is not dominated by the Held-Karp linear programming bound, or vice versa.
We present a very simple family of traveling salesman instances with $n$ cities where the nearest neighbor rule may produce a tour that is $Θ(\log n)$ times longer than an optimum solution. Our family works for the graphic, the euclidean, and the rectilinear traveling salesman problem at the same time. It improves the so far best known lower bound in the euclidean case and proves for the first time a lower bound in the rectilinear case.
The well known $4/3$ conjecture states that the integrality ratio of the subtour LP is at most $4/3$ for metric Traveling Salesman instances. We present a family of Euclidean Traveling Salesman instances for which we prove that the integrality ratio of the subtour LP converges to $4/3$. These instances (using the rounded Euclidean norm) turn out to be hard to solve exactly with Concorde, the fastest existing exact TSP solver. For a 200 vertex instance from our family of Euclidean Traveling Salesman instances Concorde needs several days of CPU time. This is more than 1,000,000 times the runtime…
Gottschalk and Vygen proved that every solution of the subtour elimination linear program for traveling salesman paths is a convex combination of more and more restrictive "generalized Gao-trees". We give a short proof of this fact, as a layered convex combination of bases of a sequence of increasingly restrictive matroids. A strongly polynomial, combinatorial algorithm follows for finding this convex combination, which is a new tool offering polyhedral insight, already instrumental in recent results for the $s-t$ path TSP.
Given an undirected graph $G=(V, E)$ with a weight function $c\in R^E$, and a positive integer $K$, the Kth Traveling Salesman Problem (KthTSP) is to find $K$ Hamilton cycles $H_1, H_2, , ..., H_K$ such that, for any Hamilton cycle $H\not \in \{H_1, H_2, , ..., H_K \}$, we have $c(H)\geq c(H_i), i=1, 2, ..., K$. This problem is NP-hard even for $K$ fixed. We prove that KthTSP is pseudopolynomial when TSP is polynomial.
The 2-Opt heuristic is a simple improvement heuristic for the Traveling Salesman Problem. It starts with an arbitrary tour and then repeatedly replaces two edges of the tour by two other edges, as long as this yields a shorter tour. We will prove that for Euclidean Traveling Salesman Problems with $n$ cities the approximation ratio of the 2-Opt heuristic is $Θ(\log n/ \log \log n)$. This improves the upper bound of $O(\log n$) given by Chandra, Karloff, and Tovey [3] in 1999.
The 2-Opt heuristic is one of the simplest algorithms for finding good solutions to the metric Traveling Salesman Problem. It is the key ingredient to the well-known Lin-Kernighan algorithm and often used in practice. So far, only upper and lower bounds on the approximation ratio of the 2-Opt heuristic for the metric TSP were known. We prove that for the metric TSP with $n$ cities, the approximation ratio of the 2-Opt heuristic is $\sqrt{n/2}$ and that this bound is tight.
Isfahan University of Technology（伊斯法罕理工大学）；Simon Fraser University（西蒙弗雷泽大学）
The Generalized Traveling Salesman Problem (GTSP) is an extension of the well-known Traveling Salesman Problem (TSP), where the node set is partitioned into clusters, and the objective is to find the shortest cycle visiting each cluster exactly once. In this paper, we present a new hybrid Ant Colony System (ACS) algorithm for the symmetric GTSP. The proposed algorithm is a modification of a simple ACS for the TSP improved by an efficient GTSP-specific local search procedure. Our extensive computational experiments show that the use of the local search procedure dramatically improves the perfor…
This paper presents a set of new formulations for the Flying Sidekick Traveling Salesman Problem, where a truck and a drone cooperate to delivery parcels to customers minimizing the completion time. The new formulations improve the results of the literature by solving to optimality several benchmark instances for which an optimal solution was previously unknown. A matheuristic algorithm, strongly based on the new models, is also discussed. Experimental results show that this method is able to provide good quality solutions in short time even for the larger instances, on which the mathematical …
We present a solution to the inverse scattering problem for differential Laplace operators on metric noncompact graphs. We prove that for almost all boundary conditions (i) the scattering matrix uniquely determines the graph and its metric structure, (ii) the boundary conditions are determined uniquely up to trivial gauge transformations. The main ingredient of our approach is a combinatorial Fourier expansion of the scattering matrix which encodes the topology of the graph into analytic properties of the scattering matrix. Using the technique developed in this work, we also propose an analyti…
We show that the classical LP relaxation of the asymmetric traveling salesman path problem (ATSPP) has constant integrality ratio. If $ρ_{\text{ATSP}}$ and $ρ_{\text{ATSPP}}$ denote the integrality ratios for the asymmetric TSP and its path version, then $ρ_{\text{ATSPP}}\le 4ρ_{\text{ATSP}}-3$. We prove an even better bound for node-weighted instances: if the integrality ratio for ATSP on node-weighted instances is $ρ_{\text{ATSP}}^{\text{NW}}$, then the integrality ratio for ATSPP on node-weighted instances is at most $2ρ_{\text{ATSP}}^{\text NW}-1$. Moreover, we show that for ATSP node-weig…
Discrete version of state transition algorithm is proposed in order to solve the traveling salesman problem. Three special operators for discrete optimization problem named swap, shift and symmetry transformations are presented. Convergence analysis and time complexity of the algorithm are also considered. To make the algorithm simple and efficient, no parameter adjusting is suggested in current version. Experiments are carried out to test the performance of the strategy, and comparisons with simulated annealing and ant colony optimization have demonstrated the effectiveness of the proposed al…
In the Traveling Salesman Problem (TSP), a list of cities and the distances between them are given. The goal is to find the shortest possible route that visits each city exactly once and returns to the original city. The TSP has a wide range of applications in many different industries including, but not limited to, optimizing mail and shipping routes, guiding industrial machines, mapping genomes, and improving autonomous vehicles. For centuries, traveling salesmen, politicians, and circuit preachers have tackled their own versions of the problem. Within the last century, the TSP has become on…
The traveling salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval. We compute the average optimal cost for every number of points when the distance function is the square of the Euclidean distance. We also show that the average optimal cost is not a self-averaging quantity by explicitly computing the …
This paper is example 5 in chapter 5. Let H be an n-cycle. A permutation s is H-admissible if Hs = H' where H' is an n-cycle. Here we define a 19 X 19 matrix, M, in the following way: We obtain the remainders modulo 100 of each of the smallest 342 odd primes. we obtain the remainders modulo 100 of each of the primes. They are placed in M according to the original value of each prime. Thus their placement depends on the the original ordinal values of the primes according to size. We use this ordering to place the primes in M. Let H_0 be an initial 19 cycles arbitrarily chosen. We apply a sequen…
Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution of the natural linear programming relaxation can be written as convex combination of spanning trees. The main argument then is that randomly sampling a tree from such a distribution and then completing the tree to a tour at minimum cost yields a better approximation guarantee than simply taking a minimum cost spanning tree (as in Christofides' algorithm). We argue that an additional step can help: reassembling the sp…
We consider the integrality gap of the subtour LP relaxation of the Traveling Salesman Problem restricted to circulant instances. De Klerk and Dobre conjectured that the value of the optimal solution to the subtour LP on these instances is equal to an entirely combinatorial lower bound from Van der Veen, Van Dal, and Sierksma. We prove this conjecture by giving an explicit optimal solution to the subtour LP. We then use it to show that the integrality gap of the subtour LP is 2 on circulant instances, making such instances one of the few non-trivial classes of TSP instances for which the integ…
Surveillance applications require a collection of heterogeneous vehicles to visit a set of targets. In this article, we consider a fundamental routing problem that arises in these applications involving two vehicles. Specifically, we consider a routing problem where there are two heterogeneous vehicles that start from distinct initial locations, and a set of targets. The objective is to find a tour for each vehicle such that each of the targets is visited at least once by a vehicle and the sum of the distances traveled by the vehicles is a minimum. We present a primal-dual algorithm for a vari…
