Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem
نویسندگان
چکیده
This paper studies the close-enough traveling salesman problem, a variant of the Euclidean traveling salesman problem in which the traveler visits a node if it passes through the neighborhood of that node. We introduce an improved version of the adaptive internal discretization scheme, recently proposed in the literature, and a heuristic that combines this scheme with to a second-order cone programming algorithm. Our heuristic is able to compute tight bounds for the problem. The computational results, carried out on benchmark instances, confirm the improvements of the bounds computed with respect to the other algorithms proposed in the literature.
منابع مشابه
An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
We address a variant of the Traveling Salesman Problem known as the Close-Enough Traveling Salesman Problem (CETSP), where the traveler visits a node if it enters a compact neighborhood set of that node. We formulate a mixed-integer programming model based on a discretization scheme for the problem. Both lower and upper bounds on the optimal CETSP tour length can be derived from the solution of...
متن کاملA novel discretization scheme for the close enough traveling salesman problem
This paper addresses a variant of the Euclidean traveling salesman problem in which the traveler visits a node if it passes through the neighborhood set of that node. The problem is known as the close-enough traveling salesman problem. We introduce a new effective discretization scheme that allows us to compute both a lower and an upper bound for the optimal solution. Moreover, we apply a graph...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملAn Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کامل