The travelling sales man problem is a mathematical problem that tasks one with finding the shortest path to travel through various cities, visiting each city only once and ending up at the origin point or city. The number of points is usually given, as well as the distance between them.

The travelling sales man problem (TSP) has been adapted in computer science, an example of this is using TSP to find the most efficient route for data to travel between various nodes.