2022 (v1)
Publication
This paper addresses a variant of the classical Traveling Salesman Problem known as Close-Enough Traveling Salesman Problem. In this problem, there is a set of nodes (customers, targets), each of them associated with a region, denoted as neighborhood, that contains it. The goal is to determine the shortest tour that visits all the nodes, where...
Uploaded on: July 7, 2023