Talk:Routing problems

From OpenStreetMap Wiki
Jump to: navigation, search

TSP is not about Dijkstra. Dijkstra is used to get the best routes between A-B, B-C and also A-C. Now traveling salesman can be used to determine the overall optimal solution e.g. by ordering them differently like A-C-B.