The selective travelling salesman problem
Discrete Applied Mathematics - Southampton conference on combinatorial optimization, April 1987
New insertion and postoptimization procedures for the traveling salesman problem
Operations Research
Approximation algorithms for the geometric covering salesman problem
Discrete Applied Mathematics
Heuristics for the multi-vehicle covering tour problem
Computers and Operations Research
The vehicle routing problem
The Capacitated m-Ring-Star Problem
Operations Research
An ILP improvement procedure for the Open Vehicle Routing Problem
Computers and Operations Research
Matheuristics: Hybridizing Metaheuristics and Mathematical Programming
Matheuristics: Hybridizing Metaheuristics and Mathematical Programming
The Generalized Covering Salesman Problem
INFORMS Journal on Computing
| Hi-index | 0.01 |
We consider a generalized version of the well known Traveling Salesman Problem called Covering Salesman problem. In this problem, we are given a set of vertices while each vertex i can cover a subset of vertices within its predetermined covering distance r"i. The goal is to construct a minimum length Hamiltonian cycle over a subset of vertices in which those vertices not visited on the tour has to be within the covering distance of at least one vertex visited on the tour. The paper proposes an Integer Linear Programming based heuristic method which takes advantage of Integer Linear Programming techniques and heuristic search to improve the quality of the solutions. Extensive computational tests on the standard benchmark instances and on a new set of large sized datasets show the effectiveness of the proposed approach.