Talk:Routing problems

From OpenStreetMap Wiki
Jump to navigation Jump to 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.

Retrieved from "https://wiki.openstreetmap.org/w/index.php?title=Talk:Routing_problems&oldid=1060833"