[GraphHopper] Creating round trips for mountain bikers

[Peter]

Hi Marian,

> One more detail question: What data source is Bike2WeightFlagEncoder
using for ascend/descend?

This depends on the elevation configuration. Either SRTM or CGIAR


> Since this is a just for fun / out of curiosity thread and since I’m
not a Java guy, I guess I won’t pursue this any further in the near future.

Still it should not be that hard ;)

Regards,
Peter.

On 23.07.2014 15:56, Marian Steinbach wrote:
> Peter, thank you very much for the reply and for the pointer to Komoot. I knew Komoot by name, but didn’t really know what it does. It’s of course difficult to judge their service without really knowing what they do. But I don’t find their results too satisfying. So I assume it takes some more cleverness to come up with better results.
>
> Since this is a just for fun / out of curiosity thread and since I’m not a Java guy, I guess I won’t pursue this any further in the near future.
>
> One more detail question: What data source is Bike2WeightFlagEncoder using for ascend/descend?
>
> Marian
>
>
> Am 23.07.2014 um 08:27 schrieb Peter <graphhopper at gmx.de>:
>
>> Hi Marian,
>>
>> the following two requirements:
>>
>> - overall distance should be within a certain range
>>
>> - the ideal round trip (start and finish on the same spot) is circle-like...
>>
>> sound more like an optimization problem rather than a routing problem
>> (what Graphhopper is about). But you could still use GraphHopper to
>> produce something like this. E.g. have a look at komoot.de/suggest where
>> they utilize GraphHopper to achieve similar. You could e.g. use 4 or
>> more points in a certain radius to produce such routes. The difference
>> to routing is that an optimization problem requires completely different
>> algorithms but the tool chain like the OSM import and graph storage etc
>> could still be reused.
>>
>> Another maybe also interesting misuse of GraphHopper could be to
>> influence the 'Weighting' in a way that it puts a penalty on a center
>> point and its neighborhood so that it looks like a hill and GraphHopper
>> routes around it e.g. when going from north to south. Then you would
>> only need two queries and it will produce fairly circle-like tours I
>> think. Still the problem with the maximum time range remains but it also
>> should be easy to guess.
>>
>>> - the more ascend (meters to climb), the better - maybe to a limit
>> See Bike2WeightFlagEncoder where we increase or decrease the speed
>> depending on the ascend/descend. You could now use this code and set the
>> priority as it is done in BikeFlagEncoder.
>>
>>> - paths are preferred over roads, but roads are okay to some degree
>> See MountainBikeFlagEncoder
>>
>> Kind Regards,
>> Peter.
>>