There would be restrictions, because you wouldnt want to go down a wrong way street etc, and some "no right turns" have physical reasons etc (such as median strip that would physically prevent you from crossing).
But there would definitely be a market for this to improve response times. In my country at least (Australia); most emergency service vehicles I know of use a standard GPS routing system that does not take this stuff into consideration...
Would love to see a free version of this.
The closest I found is Optaplanner:
See also one of our other projects https://github.com/graphhopper/jsprit
Please note that this is the chinese postman problem (visit every edge), which is different to the VRP - the vehicle routing problem (visit many nodes).
And VRP needs a routing engine to decide about the shortest distances between the nodes (usually with a distance matrix).
Didn't ask them what system it was, had other priorities at the time.
Bearing in mind the no turn between 7-9am mon-fri signs etc.
Another one is the on-off tolls. I want “I’ll pay a toll if it’s 10 minutes or more quicker”
In this case, wouldn't you want to upvote it? More people going on it means they have to suffer from more noise.
That said, if everyone hates an intersection, the mapping people should investigate why. Use it as a priority queue for audits, for instance.
I've got one for you. Rural route mail carries aren't supposed to reverse more than 50ft, among other rules. They also have routes that should be derivable from the walk sort data the post office hosts for bulk mail discounts.
The majority of them who are less technical would be deeply grateful for all they help they could get in this arena. The more technical would be even more appreciative.
Never thought about how the traveling salesman problem applied to him, though. However I did get the impression that it was a pretty cushy job and there wasn't much incentive to optimize anything. He spent the time to get to know a lot of people.
Does OSMand use GraphHopper internally? One of its downsides is the time it takes to compute a route when offline. I read in multiple places that it could use a server for doing so. Is there any documentation for self-hosting it? I didn't find anything on the topic. Is it then possible to leverage a graphhopper instance?
Also, I saw on the README that graphhopper uses djikstra and A*. Wouldn't RRT/ACO be faster to find solutions, to some extent?
BTW: you can use locus maps with our routing service or our own mobile app demo for Android: https://github.com/graphhopper/graphhopper-navigation-exampl...
> Wouldn't RRT/ACO be faster to find solutions, to some extent?
Did you try our demo and think it is slow :) ? https://graphhopper.com/maps/?point=Madrid&point=Moscow
We not only support Dijkstra and A* but also landmark (A* variant) and contraction hierarchies which makes routing very fast additionally to our optimized data structures.
The goal is therefore to traverse every residential street twice, ignoring traffic flow rules, and potentially also identifying the ideal place to start/end.
Can you see this as a viable scenario for this tool to assist with? (This is in Australia, if it makes a difference)
see the gif