Valhalla/Shortest distance route #62
Unanswered
ArterialMapping
asked this question in
Q&A
Replies: 1 comment 2 replies
-
this is correct: I can't make out a proof that it doesn't work. for that pls show 2 routes, one with it's also not really shortest, just shortest-ish. on longer routes it won't be really shortest, since there's shortcuts involved that we don't care about in valhalla. |
Beta Was this translation helpful? Give feedback.
2 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
I am attempting to compute shortest travel time-based routes as well as shortest distance-based routes. Within the Valhalla API referenced as linked on routingpy docs "shortest" is listed as a costing option in which it "Changes the metric to quasi-shortest, i.e. purely distance-based costing.
However, when running this option I am not achieving the purely shortest distance-based route. For instance, see an example from the US State of Virginia below. There are alternatives further to the west that should be using the selected area to route through; however, they are not.
So I am wondering if I am setting this up in my code incorrectly. Code is as described below for accessing the docker client and detailing the client. directions.
For using option:
I have also changed my preference to equal "shortest" instead of "fastest" which is what I had it set to for travel time. Alike to the description/image this also did not achieve the desired result. Here would be the code for preference:
So my question is, what would be the best method to achieve the actual shortest distance if the options above did not work?
Beta Was this translation helpful? Give feedback.
All reactions