Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...

The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the covering tour problem, which means that the covering distance and the associated constraints have been replaced by a new objective. We propose a two-phase cooperative strategy that combines a multi-objective evolutionar...

This paper presents a Greedy Randomized Adaptive Search Procedure (GRASP) for the Prize-Collecting Covering Tour Problem (PCCTP), which is problem of finding route traveling teams that provide services to communities geographically distant from large urban locations. We devised novel hybrid heuristic by combining reactive extension GRASP with Random Variable Neighborhood (VND) meta-heuristic pu...

The paper discusses the disk covering tour problem for reducing the mobile devices’ mobile electricity costs consumed in the wireless sensor network. The DCTP discusses how to find a tour whose cost is the minimum under the condition of the defined initial points and some planar points. The tour starts from the initial stop point. After passing many stop points, the tour returns to the initial ...

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...