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

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.

9 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


12 Victoria Link

Route 21 Corporate Park


South Africa



Tel: +27 11 966 8046


Network Coverage Solution

Google Enterprise Support

Online Store Delivery Address Solution

Last Mile Delivery Solution

Developer APIs


Google Maps Platform

Google Cloud Platform

Here Technologies

G Suite

  • LinkedIn
  • Twitter
  • YouTube
  • Facebook

In terms of section 75 of the Eletronic Communications and Transactions Act ("the Act") (28East Pty Ltd) has designegnated the Internet Service Providers Association (ISPA) as an agent to receive notifications of infringements as defined in Section 77 of the Act.

Internet Service Providers Association (ISPA) 

Address: PO BOX 518 Noordwyk 1687

Telephone: 010 500 1200

Take-down notice e-mail address: complaints@ispa.org.za