Summary
International Symposium on Nonlinear Theory and Its Applications
2016
Session Number:B3L-F
Session:
Number:B3L-F-5
Tabu Search Method for Solving Covering Salesman Problem with Nodes and Segments
Takafumi Matsuura,
pp.-
Publication Date:2016/11/27
Online ISSN:2188-5079
Summary:
As a new covering problem, we have already mathematically formulated Covering Salesman Problem with Nodes and Segments (CSPNS). In the CSPNS, a city distribution is given. The goal of the CSPNS is to identify the shortest tour of a subset of all given cities, such that each city which is not on the tour is within radius $r$ of any city or segment on the tour. In addition, we have already proposed a local search method for the CSPNS. In this paper, to find better solutions of the CSPNS, we propose a heuristic method by using a tabu search.