The Traveling Salesperson Problem with Forbidden Neighborhoods (TSPFN)

The Traveling Salesperson Problem with Forbidden Neighborhoods, TSPFN for short, is a new variant of the well known Traveling Salesperson Problem. We study it on regular two dimensional and three dimensional grids for the smallest reasonable neighborhoods.

 

In Problem Description we give an abstract and some pictures of the application and grids.

In Related Work one can find all papers that were published regarding the topic.

In TSPFN Code there is an online visualization of the TSPFN provided.

In Downloads there are papers and code related to the TSPFN to be downloaded.