Leaflet – Routing Application
The travelling salesman problem (TSP) asks the following question: "Given a list of locations and the distances between each pair of locations, what is the shortest possible route that visits each location exactly once and returns to the origin location?"