Branch-and-cut algorithms for the covering salesman problem
نویسندگان
چکیده
The Covering Salesman Problem (CSP) is a generalization of the Traveling in which tour not required to visit all vertices, as long vertices are covered by tour. objective CSP find minimum length Hamiltonian cycle over subset that covers an undirected graph. In this paper, valid inequalities from generalized traveling salesman problem applied addition new explore distinct aspects problem. A branch-and-cut framework assembles exact and heuristic separation routines for integer fractional solutions. Computational experiments show proposed outperformed methodologies literature with respect optimality gaps. Moreover, optimal solutions were proven several previously unsolved instances.
منابع مشابه
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem
In this paper we study integer linear programming models and develop branch-and-cut algorithms to solve the Black-and-White Traveling Salesman Problem (BWTSP) [4] which is a variant of the well known Traveling Salesman Problem (TSP). Two strategies to model the BWTSP have been used in the literature. The problem is either modeled on the original graph as TSP using a single set of binary edge va...
متن کاملApproximation Algorithms for the Geometric Covering Salesman Problem
We introduce a geometric version of the Covering Salesman Problem: Each of the n salesman's clients speciies a neighborhood in which they are willing to meet the salesman. Identifying a tour of minimum length that visits all neighborhoods is an NP-hard problem, since it is a generalization of the Traveling Salesman Problem. We present simple heuristic procedures for constructing tours, for a va...
متن کاملA Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints a Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
In this article we consider a variant of the classical asymmetric traveling salesman problem (ATSP), namely the ATSP in which precedence constraints require that certain nodes must precede certain other nodes in any feasible directed tour. This problem occurs as a basic model in scheduling and routing and has a wide range of applications varying from helicopter routing 25], sequencing in exible...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملThe Generalized Covering Salesman Problem
Given a graph ( , ) G N E , the Covering Salesman Problem (CSP) is to identify the minimum length tour “covering” all the nodes. More specifically, it seeks the minimum length tour visiting a subset of the nodes in N such that each node i not on the tour is within a predetermined distance di of a node on the tour. In this paper, we define and develop a generalized version of the CSP, and refe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Rairo-operations Research
سال: 2023
ISSN: ['1290-3868', '0399-0559']
DOI: https://doi.org/10.1051/ro/2023055