When Hashing Met Matching: Efficient Search for Potential Matches in Ride Sharing

arXiv: Data Structures and Algorithms, Volume abs/1809.02680, 2018.

Cited by: 0|Views2
EI

Abstract:

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

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments