Taxi-hailing platforms: Inform or Assign drivers?
文献类型:期刊论文
作者 | Sun, Luoyi1,3; Teunter, Ruud H.5; Hua, Guowei1; Wu, Tian2,4 |
刊名 | TRANSPORTATION RESEARCH PART B-METHODOLOGICAL
![]() |
出版日期 | 2020-12-01 |
卷号 | 142页码:197-212 |
关键词 | Sharing economy Two-sided market Peer-to-peer market Ride-sourcing platform |
ISSN号 | 0191-2615 |
DOI | 10.1016/j.trb.2020.10.001 |
英文摘要 | Online platforms for matching supply and demand, as part of the sharing economy, are becoming increasingly important in practice and have seen a steep increase in academic interest. Especially in the taxi/travel industry, platforms such as Uber, Lyft, and Didi Chuxing have become major players. Some of these platforms, including Didi Chuxing, operate two matching systems: Inform, where multiple drivers receive ride details and the first to respond is selected; and Assign, where the platform assigns the driver nearest to the customer. The Inform system allows drivers to select their destinations, but the Assign system minimizes driver-customer distances. This research is the first to explore: (i) how a platform should allocate customer requests to the two systems and set the maximum matching radius (i.e., customer-driver distance), with the objective to minimize the overall average waiting times for customers; and (ii) how taxi drivers select a system, depending on their varying degrees of preference for certain destinations. Using approximate queuing analysis, we derive the optimal decisions for the platform and drivers. These are applied to real-world data from Didi Chuxing, revealing the following managerial insights. The optimal radius is 1-3 kilometers, and is lower during rush hour. For most considered settings, it is optimal to allocate relatively few rides to the Inform system. Most interestingly, if destination selection becomes more important to the average driver, then the platform should not always allocate more requests to the Inform system. Although this may seem counterintuitive, allocating too many orders to that system would result in many drivers opting for it, leading to very high waiting times in the Assign system. (c) 2020 Elsevier Ltd. All rights reserved. |
资助项目 | National Natural Science Foundation of China[71831001] ; National Natural Science Foundation of China[71804181] |
WOS研究方向 | Business & Economics ; Engineering ; Operations Research & Management Science ; Transportation |
语种 | 英语 |
WOS记录号 | WOS:000592551100010 |
出版者 | PERGAMON-ELSEVIER SCIENCE LTD |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/52501] ![]() |
专题 | 中国科学院数学与系统科学研究院 |
通讯作者 | Hua, Guowei |
作者单位 | 1.Beijing Jiaotong Univ, Beijing, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing, Peoples R China 3.3 Shangyuancun, Beijing, Peoples R China 4.55 East Zhongguancun Rd, Beijing, Peoples R China 5.Univ Groningen, POB 72, NL-9700 AB Groningen, Netherlands |
推荐引用方式 GB/T 7714 | Sun, Luoyi,Teunter, Ruud H.,Hua, Guowei,et al. Taxi-hailing platforms: Inform or Assign drivers?[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL,2020,142:197-212. |
APA | Sun, Luoyi,Teunter, Ruud H.,Hua, Guowei,&Wu, Tian.(2020).Taxi-hailing platforms: Inform or Assign drivers?.TRANSPORTATION RESEARCH PART B-METHODOLOGICAL,142,197-212. |
MLA | Sun, Luoyi,et al."Taxi-hailing platforms: Inform or Assign drivers?".TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 142(2020):197-212. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。