50 states example

jotting down notes for a possible application of the RPP/CPP package

Idea

Apply RPP/CPP on a network representing a map of DC where roads are edges and nodes are the end points of roads.

Objective: cover all 50 avenues named after the states.

Logic

1. Create graph: Create 50 edges (if each state avenue is contiguous) from start to end (2 nodes w lat/lon)
2. For each node find the shortest path (using OSM road routing, or similar) to each other node (~99 nodes). These are the optional roads
3. Solve RPP
4. Map it?

Resources

• Finnish post parsing street level geojson: https://dataist.wordpress.com/2011/11/25/tutorial-how-to-extract-street-coordinates-from-open-street-map-geodata/
• DC roads geojson (complete street lat/long... but no names grrr ) : http://opendata.dc.gov/datasets?q=roads
• Download OSM data using boundingbox using overpass API (works): http://www.overpass-api.de/query_form.html
• Download 400MB DC OSM here: http://download.geofabrik.de/north-america.html
• Map: DC State streets: https://ggwash.org/view/2530/washingtons-systemic-streets
• Creating route planner for road network in networkx: http://ipython-books.github.io/featured-03/
• Handling parallel divided roads (same road): https://help.openstreetmap.org/questions/43654/finding-and-merging-parallel-ways-that-are-part-of-the-same-street-in-osm-file