Traveling Salesman Problem (TSP) is one of the major problems in Operations Research from the

last few decades. Given n pre-specified cities, the goal is to find the minimum length tour of the cities

such ...

In this paper we introduce the Generalized Covering Salesman Problem. A Variable Neighborhood Search Algorithm has been applied to solve the problem....

distance from the cities on the tour. In this paper we define and develop a generalized version of this problem, and name it Generalized Covering Salesman Problem (GCSP), in which each city i needs to be covered at least times and there is a visiting cost...

generalized version of this problem and name it, Generalized Covering Salesman Problem (GCSP), in which each customer i needs to be covered at least k(i) times and there is a visiting cost associated with each customer. We define three variants of this new...

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 refer to it as the Generalized Covering Salesman Problem (GCSP). Here, each node i needs to be covered at least times...

predetermined distance from the nodes on the tour. In the

Generalized Covering Salesman Problem (GCSP) each node i needs to be covered at least i k times

and there is a visiting cost associated with each node. This problem has three variants...