Price-aware Real-time Ride-sharing at Scale - An Auction-based Approach

被引:71
作者
Asghari, Mohammad [1 ]
Deng, Dingxiong [1 ]
Shahabi, Cyrus [1 ]
Demiryurek, Ugur [1 ]
Li, Yaguang [1 ]
机构
[1] Univ Southern Calif, Los Angeles, CA 90007 USA
来源
24TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2016) | 2016年
关键词
Ride-sharing; Revenue Maximization; Spatial Crowdsourcing;
D O I
10.1145/2996913.2996974
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Real-time ride-sharing, which enables on-the-fly matching between riders and drivers (even en-route), is an important problem due to its environmental and societal benefits. With the emergence of many ride-sharing platforms (e.g., Uber and Lyft), the design of a scalable framework to match riders and drivers based on their various constraints while maximizing the overall profit of the platform becomes a distinguishing business strategy. A key challenge of such framework is to satisfy both types of the users in the system, e.g., reducing both riders' and drivers' travel distances. However, the majority of the existing approaches focus only on minimizing the total travel distance of drivers which is not always equivalent to shorter trips for riders. Hence, we propose a fair pricing model that simultaneously satisfies both the riders' and drivers' constraints and desires (formulated as their profiles). In particular, we introduce a distributed auction-based framework where each driver's mobile app automatically bids on every nearby request taking into account many factors such as both the driver's and the riders' profiles, their itineraries, the pricing model, and the current number of riders in the vehicle. Subsequently, the server determines the highest bidder and assigns the rider to that driver. We show that this framework is scalable and efficient, processing hundreds of tasks per second in the presence of thousands of drivers. We compare our framework with the state-of-the-art approaches in both industry and academia through experiments on New York City's taxi dataset. Our results show that our framework can simultaneously match more riders to drivers (i. e., higher service rate) by engaging the drivers more effectively. Moreover, our framework schedules shorter trips for riders (i.e., better service quality). Finally, as a consequence of higher service rate and shorter trips, our framework increases the overall profit of the ride-sharing platforms.
引用
收藏
页数:10
相关论文
共 25 条
  • [1] [Anonymous], 2013, P 21 ACM SIGSPATIAL
  • [2] SHAREK: A Scalable Dynamic Ride Sharing System
    Cao, Bin
    Alarabi, Louai
    Mokbel, Mohamed F.
    Basalamah, Anas
    [J]. 2015 16TH IEEE INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT, VOL 1, 2015, : 4 - 13
  • [3] Cici B., 2015, GIS 15
  • [4] Assessing the Potential of Ride-Sharing Using Mobile and Social Data: A Tale of Four Cities
    Cici, Blerim
    Markopoulou, Athina
    Frias-Martinez, Enrique
    Laoutaris, Nikolaos
    [J]. UBICOMP'14: PROCEEDINGS OF THE 2014 ACM INTERNATIONAL JOINT CONFERENCE ON PERVASIVE AND UBIQUITOUS COMPUTING, 2014, : 201 - 211
  • [5] The dial-a-ride problem: models and algorithms
    Cordeau, Jean-Francois
    Laporte, Gilbert
    [J]. ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) : 29 - 46
  • [6] THE TRUCK DISPATCHING PROBLEM
    DANTZIG, GB
    RAMSER, JH
    [J]. MANAGEMENT SCIENCE, 1959, 6 (01) : 80 - 91
  • [7] Demiryurek U, 2009, LECT NOTES COMPUT SC, V5644, P25, DOI 10.1007/978-3-642-02982-0_5
  • [8] DENG D, 2015, P 23 SIGSPATIAL INT, P21
  • [9] Ridesharing: The state-of-the-art and future directions
    Furuhata, Masabumi
    Dessouky, Maged
    Ordonez, Fernando
    Brunet, Marc-Etienne
    Wang, Xiaoqing
    Koenig, Sven
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2013, 57 : 28 - 46
  • [10] Large Scale Real-time Ridesharing with Service Guarantee on Road Networks
    Huang, Yan
    Bastani, Favyen
    Jin, Ruoming
    Wang, Xiaoyang Sean
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2014, 7 (14): : 2017 - 2028