-
Notifications
You must be signed in to change notification settings - Fork 3.3k
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 through specified points (that are unordered) #1704
Comments
This sounds similar to the Traveling Salesman Problem. With the latest v4.8.0 release we expose the trip plugin that can solve exactly those questions. The API looks like the following:
/cc @chaupow |
@daniel-j-h Thanx for the response. |
4.8.0 is already released. |
Where can I find more documentation about the trip plugin?
But then I have tried to use the link on localhost and I have gotten some result. but I don't know how to use it. So I am looking for more docs. |
@TheMarex just added initial docs for the trip plugin to the Wiki, take a look: The demo router at project-osrm.org currently runs on stale data and does not yet have the latest release. Bringing @freenerd into this ticket: he is currently working on resolving this; should be done in the next days. |
OK, thanks. This is a great announcement!! |
The project-osrm.org demo server should be fixed soon again (run on develop branch with recent OSM dataset). Only waiting on @DennisOSRM here to switch the domain to new infrastructure. |
This should be good now. |
I have a source and destination points (A and B) and a few intermediate points (C, D, E, F, J...) that an object has to visit.
Is there an opportunity to build a route that will calculate an optimal (shortest) route through this points if there is no order of visiting points?
As I understand Dijkstra algorithm can be used to resolve this issue
The text was updated successfully, but these errors were encountered: