A Two-Sided Stable Matching Method in Ridesharing

Abstract

Many researchers have studied optimization methods for ridesharing. However, the individual interests of passengers and drivers are not considered enough. So we propose a two-sided stable matching method according to the actual preferences of passengers(requesters) and drivers(workers). We also design a pruning algorithm based on Euclidean distance to speed up the matching process. Experiments based on real data show that our method can perform well.