On Solving Close Enough Orienteering Problems with Overlapped Neighborhoods

Qiuchen Qian, Yanran Wang, David Boyle

Close Enough Traveling Salesman Problem (CETSP) is a well-known variant of TSP whereby the agent may complete its mission at any point within a target neighborhood. Heuristics base…