On Improvement Heuristic to Solutions of the Close Enough Traveling Salesman Problem in Environments with Obstacles

In this paper, we present a novel improvement heuristic to address the Close Enough Traveling Salesman Problem in environments with obstacles (
$\text{CETSP}_{\text{obs}}$
). The
$\text{CETSP}_{\text{obs}}$
is a variant of the Traveling Salesman Problem (TSP), where the goal is to find a sequence of visits to given disk-shaped regions together with the points of visits to the regions. We address challenging instances in a polygonal domain with polygonal obstacles, where the final path connecting the regions must be collision-free. We propose a novel Post-Optimization procedure using Mixed Integer Non-Linear Programming (MINLP) to improve existing heuristic solutions to the
$\text{CETSP}_{\text{obs}}$
. We deploy the method with existing heuristic solvers and based on the presented evaluation results, the proposed Post-Optimization significantly improves the heuristic solutions of all examined solvers and makes them competitive regarding the solution quality. The statistical evaluation reveals that the sequence found using relatively sparse sampling of the disk regions yields the best solutions among the evaluated solvers. The results support the benefit of the proposed MINLPbased solution to the continuous optimization of the
$\text{CETSP}_{\text{obs}}$
.