The “Traveling Salesman Problem” refers to an optimization problem originating from the plight of salespeople struggling to plan a route between all of their door-to-door stops for the day. In the world of computer science, computational time for solving problems can vary vastly depending on the complexity of the problem. For a traveling salesman making upwards of 50 stops per day, it can be tough to calculate the fastest possible route among every single possible option. Thankfully, GIS can often provide the best practical solution in a world where everyone is always on the move.