• 28East

What is the Traveling Salesman Problem (TSP)?

Updated: Sep 21, 2020

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).


Goal -

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.



Traveling Salesman Problem (TSP) with four locations

To know more about our Route & Load Optimisation check our page or join us by email by email : info@28east.co.za


The 28East Team.

11 views0 comments

Recent Posts

See All

What is Vehicle Routing Problem?

Above all we have general term or version of TSP which is called: VRP. All those issues above are part of VRP: Traveling salesman problem, the classic routing problem in which there is just one vehicl

What is Vehicle Routing ?

Vehicle Routing is the application of optimisation. Goal - Find the best routes for a fleet of vehicles visiting a set of locations. Best = routes with the least of total distance or cost. Routing pro