Top-$k$k Vehicle Matching in Social Ridesharing: A Price-Aware Approach
Lists
Only you see this
Abstract
In the past few years ridesharing has largely reshaped the transportation marketplace. It is envisioned as a promising solution to transportation-related problems in metropolitan cities, such as traffic congestion and air pollution. In the current ridesharing research, social ridesharing, which makes use of social relations among drivers and riders to address safety issues, and dynamic pricing are two active directions with important business implications. Simultaneously optimizing social cohesion and revenue is vital to a commercial ridesharing platform's sustainable development, which, however, has not been previously studied. In this paper, we first present a new pricing scheme that better incentivizes drivers and riders to participate in ridesharing, and then propose a novel type of Price-aware Top- <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> Matching (PTkM) queries which retrieve the top- <inline-formula><tex-math notation="LaTeX">$k$</tex-math></inline-formula> vehicles for a rider's request by taking into account both social relations and revenue. We design an efficient algorithm with a set of powerful pruning techniques to tackle this problem. Moreover, we propose a novel index tailored to our problem to further speed up query processing. Extensive experimental results on real datasets show that our proposed algorithms achieve desirable performance for real-world deployment.
BibTeX
@article{li2021top,
author = {Yafei Li and Ji Wan and Rui Chen and Jianliang Xu and Xiaoyi Fu and Hongyan Gu and Pei Lv and Mingliang Xu},
title = {{Top-$k$k Vehicle Matching in Social Ridesharing: A Price-Aware Approach}},
journal = {IEEE Trans. Knowl. Data Eng.},
year = {2021},
doi = {10.1109/tkde.2019.2937031},
}Loading related content...