What is the Traveling Salesman Problem (TSP)?
Updated: Sep 21
There are several routing problems examples as we mentioned previously in this article "What is Vehicle Routing Problem?"
But the most famous routing problem is the Traveling Salesman Problem (TSP).
Find the shortest route for a salesman who needs to visit customers are differents locations and return to the starting point.
The picture below show a TSP with four locations: AB, CD.
The distance between 2 locations is given by the number.
To know more about our Route & Load Optimisation check our page or join us by email by email : email@example.com
The 28East Team.