When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing
arXiv: Data Structures and Algorithms, Volume abs/1809.02680, 2018.
We study the problem of matching rides in a ride sharing platform. Such platforms face the daunting combinatorial task of finding potential matches for rides from a matching pool of tens of thousands of rides very efficiently while retaining near-optimality compared to an exhaustive search. We formalize this problem and present a novel al...More
Full Text (Upload PDF)
PPT (Upload PPT)