Optimally Allocate Geographically Distributed Tasks
How can we efficiently collect data from geographically distributed locations? If the data collection is being crowd-sourced, then we may want to exploit the fact that workers are geographically distributed. One simple heuristic to do so is to order the locations by distance for each worker (with some task registration backend). If you have hired workers (or rented drones) who you can send to different locations, then you must split the tasks across workers (drones), and plan the ‘shortest’ routes for each, ala the Traveling Salesman Problem (TSP). This is a problem that companies like Fedex etc. solve all the time. Since there are no computationally feasible solutions for solving for the global minimum, one heuristic solution is to split the locations into clusters of points that are close to each other (ideally, we want the clusters to be ‘balanced’), and then to estimate a TSP solution for each cluster.
The package provides a simple way to implement these solutions. Broadly, it provides three kinds of functions:
- Sort by Distance: Produces an ordered list of workers for each point or an ordered list of points
- for each worker.
- Cluster the Points: Clusters the points into n_worker groups.
- Shortest Path: Order points within a cluster (or any small number of points) into a path or itinerary.
The package also provides access to three different kinds of distance functions for calculating the distance matrices that underlie these functions:
- Euclidean Distance: use option -d euclidean; similar to the Haversine distance within the same UTM zone)
- Haversine Distance: use option -d haversine.
- OSRM Distance: use option -d osrm. Neither Haversine nor Euclidean distance take account of the actual road network or the traffic. To use actual travel time, use Open Source Routing Machine API A maximum number of 100 points can be passed to the function if we use the public server. However, you can set up your own private OSRM server with --max-table-size to specific the maximum number of points.
- Google Distance Matrix API:. use option -d google. This option available in sort_by_distane and cluster_kahip only due to Google Distance Matrix API has very usage limits. Please look at the limitations here.
Missing Women on the streets of Delhi. See women count
pip install allocator
Cluster data collection locations using k-means (clustering) or KaHIP (graph partitioning). To check which of the algorithms produces more cohesive, balanced clusters, run Compare K-means to KaHIP
These function can be used find the estimated shortest path across all the locations in a cluster. We expose three different ways of getting the ‘shortest’ path, a) via MST (Christofides algorithm), b) via Google OR-Tools, b) Google Maps Directions API.
Documentation available at: https://allocator.readthedocs.io/en/latest/
Contributor Code of Conduct
The project welcomes contributions from everyone! In fact, it depends on it. To maintain this welcoming atmosphere, and to collaborate in a fun and productive way, we expect contributors to the project to abide by the Contributor Code of Conduct.
The package is released under the MIT License.
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
|Filename, size||File type||Python version||Upload date||Hashes|
|Filename, size allocator-0.1.7.tar.gz (25.4 MB)||File type Source||Python version None||Upload date||Hashes View|