Tabu Search for Solving Covering Salesman Problem with Nodes and Segments

We have already mathematically formulated a Covering Salesman Problem with Nodes and Segments (CSPNS). In CSPNS, a node distribution is given. In CSPNS, some nodes are selected from the given set, and a tour is constructed that visits these nodes. An objective of CSPNS is to identify the shortest tour that covers all given nodes by segments and nodes in the tour. In this study, to find good near-optimal solutions within a reasonable time frame, we propose a heuristic method using tabu search.