Knowledge Base



KB10308 - Traveling Salesman routing problem involving multiple waypoints.

The Traveling Salesman Problem is a complex multiple point routing problem requiring a specialized, and typically expensive, algorithm to resolve. This is outside the scope of the routing functionality supported in TatukGIS products, though a DK customer can implement their own multi-point routing algorithm into a DK developed application. Other than the algorithm itself, the DK supports the other elements that are required to address the Traveling Salesman multi-point routing problem.

The DK supported routing functionality is described in KB10681 and demonstrated in the DK Geocoding source code sample found in DK Sample Set #2.

Created: November 21, 2003, Modified: December 22, 2015
follow us on Facebook  follow us on Twitter  follow us on Google +  follow us on LinkedIn  Embarcadero