The Traveling Salesperson Problem with Forbidden Neighborhoods (TSPFN)

We introduce the Traveling Salesman Problem with forbidden neighborhoods (TSPFN). This is an extension of the Euclidean TSP in the plane where direct connections between points that are too close are forbidden. The TSPFN is motivated,by an application in laser beam melting. In the production of a workpiece in several layers using this method one hopes to reduce the internal stresses of the workpiece by excluding the heating of positions that are too close. The points in this application are often arranged in some regular (grid) structure.


We study optimal solutions of TSPFN instances where the points in the Euclidean plane, respectively space, are the points of a regular grid. Indeed, we explicitly determine the optimal values for the TSPFN and its associated path version on rectangular regular two- and three-dimensional grids for different minimal distances of the points visited consecutively. For establishing lower bounds on the optimal values we use combinatorial counting arguments depending on the parities of the grid dimensions. Furthermore we provide construction schemes for optimal TSPFN tours for the considered cases.

We provide Matlab code for the visualization of optimal TSPFN tours with r=0, r=1 and r=2^{0.5}.

Summary document containing all relevant optimal tours of small dimension for the TSPFN with r=2.