I got brought here by Google when I asked about making a route to visit every address in my town in the shortest distance, least amount of re-tracing my steps. Is this something that can be figured out easily by OSM?
It can be figured out. Easily…? Depends. Are you a developer?
What does “visit every address” mean for you, exactly? If Itʼs enough to travel every street at least once, that is called the Chinese Postman Problem and considerably easier to solve than to visit every address.
One way to go about it could be to download the road graph for your city from OSM using OSMnx and then solve the CPP using NetworkX. Here’s an elaborate post about it:
I’m sure others have other ideas and chime in.
For small area you can try using http://www.everystreetchallenge.com/