New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Shortest path ignoring waypoint order #611
Comments
it's not possible at the moment. what you're describing is essentially the travelling salesman problem - find the shortest way to visit a given list of points. |
It is not yet possible. But it is on the list of upcoming features. |
Hi DennisOSRM, Any news update regarding that feature? :-) |
hi dennis, do you have an idea about when this feature will arrive? |
The distance matrix forms the basis for fast optimization of waypoint order? |
@emiltin yessir. |
Hi Dennis, is there any ETA on this feature? |
I think it would make more sense to use a travel time matrix since the route calculation is based on fastest and not shortest path. Is a travel time matrix in the plan? |
Work on this by @chaupow is tracked in this branch https://github.com/Project-OSRM/osrm-backend/tree/feature/round_trip |
This is now merged into |
Hi guys, I looked everywhere and I didn't find a way to get this to work.
Let's suppose I want to know the shortest path from node A to D, but I have to pass through B and C in the way.
I dont care if I put the params (lat/lng) is this order A -> B -> C -> D or that A -> C -> B -> D because I should get the same result, the shortest path.
This feature is similar to Google Maps option optimizeWaypoints="true"
Is that possible with OSRM?
The text was updated successfully, but these errors were encountered: