TSP is an algorithmic problem focused on finding the shortest possible route for a salesman to visit a set of cities exactly once and return to the starting point.