Hi, everybody!
I want to use graphhopper in my project. I really like the project, thank you for developing it.
I want to run my own graphhopper server and use it via c# client (https://github.com/graphhopper/directions-api-clients), I am developing in c # and unfortunately i can’t develop in java.
I have very big accumulated gps data of movements of our trucks, I want to use it to build optimal routes.
We build many routes to different regions of our country and cover long distances.
Experienced drivers know which roads are better to drive, and which roads to bypass. We accumulate gps movements of experienced drivers. But there are many inexperienced logisticians and drivers who do not know about the best routes. We want them to be able to build an optimal route taking into account the experience of the trodden roads.
Basically, we have a problem with bypass roads where a truck drives from city A to B and on the way passes through different cities. The routers often builds a route through the city because it is so closer the distance. But in fact it is easier to drive through the bypass roads without going into the city, it will be better that way.
The big truck profile does not solve the problem, because not all roads on the map are marked as highways and not all highways are comfortable to travel.
The peculiarity of our Russian roads is such that even if the road is marked as a highway on the map, it can be bad for driving, and experienced drivers know which roads are in good condition and which are not, which roads are wide and comfortable.
Based on the accumulated gps coordinates of the optimal roads, we want to patch the osm map file, so that later when building routes, the router can take into account these optimal roads. So that when building routes, preference is given to those roads that we have already trodden earlier.
Could you tell me is it possible to implement this with graphhopper ?
Also, we want to take into account toll and free roads, is this possible?
I will be glad to receive any of your tips.
