|
|
|
Ask HN: Figure out the routes of LA Street Cleaners from 500K parking tickets?
|
|
6 points
by davidhegarty
4083 days ago
|
|
HN - we're looking for some help. We have 500K Street Cleaning tickets from LA. Each ticket has the address of where the ticket was issued, and the date/time of when the ticket was issued. From the time sequence of these tickets, we'd like to plot on a map the routes that the Street Cleaning Vehicles drive with the approximate start and stop times. Complications:
1) At any given time, there could be multiple street cleaning vehicles out there.
2) Street Cleaning vehicles follow both daily/weekly/bi-weekly/monthly schedules
3) In general, the tickets are issued at roughly the same time that the street cleaning vehicle passes.... but sometimes it can be 10-15 minutes beforehand. Okay, that's our problem... give us your best suggested solutions. Thanks! |
|
Now, with all your peaks sorted out for each bin, you want to construct a graph from bin to bin where your graph is constructed where an adjacent node in the graph is added if the numerical distance between the two peaks is the smallest of all choices. You should iteratively repeat the process until all the relevant bins are connected
Then brute force the permutations of arrangements of peaks and you should get a rough approximation of the path of the person issuing tickets.