TMATCH: A New Framework for Supporting Car-Sharing Under Carpooling Model

With the rapid development of mobile Internet and sharing economy, carpooling over real-time taxi-calling service has attracted more and more attention. Many popular taxi-calling service platforms, e.g. didi, Uber, have developed carpooling service to the passengers. Their goal is maximizing overall profit while meeting passengers' convenience and economic benefits. This paper studies the problem of distributed tasks matching over road network. We first propose a random server selection algorithm to send tasks to different servers. Next, we propose a novel index to maintain tasks in each server. Last of all, we discuss how to execute tasks matching over road network. The results demonstrate the superior performance of our proposed algorithms.