search

codereport / city-strides-hacking

Python scripts that build optimal routes for node collection
MIT License
9 stars 3 forks source link

HACKATHON 2023 #1

Closed codereport closed 1 year ago

codereport commented 1 year ago

Goals

  1. [x] Figure out how to query OSM
  2. [x] Build query for all streets/nodes/edges for local frame/global
  3. [ ] Build route builder for:
    • [ ] Most streets in a new city
    • [ ] Most efficient route in a dense area (no nodes left behind)
  4. [ ] Determine best cities in the world (shortest average street length)

Resources:

codereport commented 1 year ago

First two items completed with this commit: https://github.com/codereport/city-strides-hacking/commit/133a2573948f72aa336ad847f2f35135979d4b37

codereport commented 1 year ago

Day 2 of hackathon worked mostly on route generation. Things learned:

  1. Need two sources of data
    • One for City Strides Nodes
    • One for all nodes in order to generate correctly
  2. Doing a MCTS doesn't really work because of the randomness. Should just do BFS and take best route.
  3. This problem is harder than it seems.

Work was mostly done in this commit: https://github.com/codereport/city-strides-hacking/commit/bbc17dffa18961543537720facc75fcfc9503b37

Will come back to this problem. Closing issue as hackathon is done.

codereport commented 1 year ago

Let's go! Iterative BFS definitely was the right way to go. Just implemented a simple version of it (https://github.com/codereport/city-strides-hacking/commit/0425b1ecdf7261392d4477b4614330d020775f39) and the results was SO much better than what was there before:

image