A classic mathematical problem that finds the shortest distance of round trip travel between multiple locations. The traveling salesman problem (TSP) generates directions from city 1 to city 2 and so ...