4 ms·
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
by karussell 9y ago
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 non-fully contracted networks is really nice and could be worth a try - thanks!
- n4r9 9y agoWow, that seems counter-intuitive. I suppose it must be due to the computation of the heuristic, combined with how few relaxations are needed in CH. GraphHopper is really nice work by the way. I believe you are still working on implementing stall-on-demand? Will be very interesting to see how much difference that makes on long-distance queries.
- karussell 9y agoI guess it is the overhead of the heuristic that is too much compared with the saved visited nodes, but this is counter-intuitive for me as well and if I have more time will investigate this again. > GraphHopper is really nice work by the way. Thanks! > I believe you are still working on implementing stall-on-demand? I've not yet digged into it but others have with less success but would be very interesting: https://github.com/graphhopper/graphhopper/issues/240#issuecomment-297787098 https://github.com/graphhopper/graphhopper/issues/240#issuec...