An Efficient Algorithm for the Tabu Clustered Traveling Salesman Problem

This paper addresses the Tabu Clustered Traveling Salesman Problem, a recent variation of TSP motivated by a real-life application in the management of satellite network. In the TCTSP, nodes are split into two distinct partitions, named tabus and clusters. The TCTSP consists of finding a minimum cost cycle that contains exactly one node of each tabu and visits nodes of the same cluster consecutively. We propose a reactive GRASP heuristic that is competitive in terms of both time efficiency and solution quality in comparison with the literature results.