SOTA-Py
Dev tools
routing research solver
SHOW HN2017
How HN took it
2 positive, 6 neutral or asking, 0 mixed, 1 critical, out of 9 comments about the project. Thread score +0.12.
Idea: 2 for, 0 againstPricing: 0 for, 1 against
The thread, comment by comment
Each row is a top-level comment and its replies, in HN's order. Select a cell to open that comment on HN.
positive neutral or mixed critical about another commenter or something else the maker
What HN said
What people liked
Demo looks cool and the work is interesting for routing research
From 2 comments
The demo looks really cool. Do any of the major navigation apps utilize these algorithms?
jamesrom on HNI'm very interested in this. Thanks for sharing. Having coded up a semisolid implementation of time-dependent contraction hierarchies (which might not even get used, because of…
n4r9 on HN
Objections
Computationally too heavy for real navigation apps (tens of seconds per query)
From 2 comments
Thank you! I don't believe any apps utilize these algorithms, and for good reason. The main problem is that SOTA is a very computationally intensive problem. On the example…
mehrdadn on HN> Is the main RAM usage from the graph or is the algorithm RAM intense? The graph itself is negligible, unless you want to store lots of auxiliary data (street addresses and…
mehrdadn on HN
Code is poorly written and not meant for production use
From 1 comment
> Is the main RAM usage from the graph or is the algorithm RAM intense? The graph itself is negligible, unless you want to store lots of auxiliary data (street addresses and…
mehrdadn on HN
Requests
Add Numba support to speed up computation
From 1 comment
Can you look into adding numba support to accelerate the computation?
sandGorgon on HN
Questions
Whether major navigation apps use these algorithms
From 1 comment
The demo looks really cool. Do any of the major navigation apps utilize these algorithms?
jamesrom on HN
Why the license is non-commercial
From 1 comment
Thanks for this! Did you measure memory usage for e.g. San Francisco or Berlin? Why did you consider this non-commercial license? Especially since you say 'I don't plan on…
karussell on HN
Memory usage on large cities
From 2 comments
Thanks for this! Did you measure memory usage for e.g. San Francisco or Berlin? Why did you consider this non-commercial license? Especially since you say 'I don't plan on…
karussell on HN> Is the main RAM usage from the graph or is the algorithm RAM intense? The graph itself is negligible, unless you want to store lots of auxiliary data (street addresses and…
mehrdadn on HN
Alternatives named
Contraction hierarchies and time-dependent Dijkstra/A*
From 2 comments
I'm very interested in this. Thanks for sharing. Having coded up a semisolid implementation of time-dependent contraction hierarchies (which might not even get used, because of…
n4r9 on HNThanks for the answers. I see what you're saying about the Markov properties - certainly something to think about. > I haven't had a chance to attempt it -- although it's not…
n4r9 on HN
GraphHopper routing engine
From 1 comment
Interesting, we (GraphHopper) tested CH+ALT and saw also no improvements, also for CH with normal A*, although it is reported in papers that it should be faster. The idea about…
karussell on HN