When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing
Keywords:Transportation, Optimization of Spatio-temporal Systems, Heuristic Search, Mining of Spatial, Temporal or Spatio-Temporal Da
AbstractShared on-demand mobility holds immense potential for urban transportation. However, finding ride matches in real-time at urban scale is a very difficult combinatorial optimization problem and mostly heuristic approaches are applied. In this work, we introduce a principled approach to this combinatorial problem. Our approach proceeds by constructing suitable representations for rides and driver routes capturing their essential spatio-temporal aspects in an appropriate vector space, and defining a similarity metric in this space that expresses matching utility. This then lets us mathematically model the problem of finding ride matches as that of Near Neighbor Search (NNS). Exploiting this modeling, we devise a novel spatio-temporal search algorithm for finding ride matches based on the theory of Locality Sensitive Hashing (LSH). Apart from being highly efficient, our algorithm enjoys several practically useful properties and extension possibilities. Experiments with large real-world datasets show that our algorithm consistently outperforms state-of-the-art heuristic methods thereby proving its practical applicability.
How to Cite
Dutta, C. (2021). When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing. Proceedings of the AAAI Conference on Artificial Intelligence, 35(1), 90-98. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16081
AAAI Technical Track on Application Domains