|
How can I calculate the time to travel a full city's streets based on OpenStreetMap data? Basically I would like to apply a filter to not use footways, I guess I could generate such an OSM file from a OSM XAPI server. Next I would have to create a graph and run a travelling algorithm on it? Which algorithm could I use? Do I need travelling salesman or is there something easier / faster? Approximations would be fine as well. Did anybody do such a thing yet? |
NOTICE: help.openstreetmap.org is no longer in use from 1st March 2024. Please use the OpenStreetMap Community Forum
Follow this question
By Email:Once you sign in you will be able to subscribe for any updates here
By RSS:Markdown Basics
- *italic* or _italic_
- **bold** or __bold__
- link:[text](http://url.com/ "title")
- image?
- numbered list: 1. Foo 2. Bar
- to add a line break simply add two spaces to where you would like the new line to be.
- basic HTML tags are also supported
Question tags:
question asked: 20 Oct '18, 09:28
question was seen: 988 times
last updated: 20 Oct '18, 11:32
Related questions
NOTICE: help.openstreetmap.org is no longer in use from 1st March 2024. Please use the OpenStreetMap Community Forum
This question's answers might be of use: https://help.openstreetmap.org/questions/55994/traveling-salesman-routing
The question if such a Travelling salesman algorithm works also with hundreds of households in a smaller city. Let's call if the flayer distribution problem...