Traveling Salesman Problem (TSP)

Home > Transportation > Logistics (transportation) > Route optimization > Traveling Salesman Problem (TSP)

TSP involves finding the shortest route that would visit every location on a given list once and return to the starting point. TSPs can be complex when there are hundreds or thousands of locations to visit.