I want to calculate the route between multiple points, respecting the order of the list.
For example, if I have the following list:
- Lat: -40, Long: -30
- Lat: -41, Long: -31
- Lat: -40.5, Long: -30.5
I want the route to go from point 1 to 2, and then from point 2 to 3.
- I don't want to calculate the best path from 1 to 2 and 3 (Travelling Sales Person) because that would give me a path 1-3-2, as the 1st point is closer to the 3rd point than the 2nd one.
- I don't want to calculate the best path from 1 to 2, and from 1 to 3 (Mutliple destination Shortest Path Dijkstra), because that would give me a path from 1 to 2 and from 1 to 3.
I want it to calculate the best path from 1 to 2, and then from 2 to 3. All with just 1 query, using pgrouting.
It would be something like a TSRP but preserving the order of the points. Google already does that (https://developers.google.com/maps/documentation/javascript/directions#Waypoints) and if you want, they can optimize the order of the waypoints (using TSRP)