Taxi-hailing platforms: Inform or Assign drivers?

计算机科学 互联网隐私 运输工程 业务 数据科学 工程类
作者
Luoyi Sun,Ruud H. Teunter,Guowei Hua,Tian Shung Wu
出处
期刊:Transportation Research Part B-methodological [Elsevier]
卷期号:142: 197-212 被引量:8
标识
DOI:10.1016/j.trb.2020.10.001
摘要

Abstract 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 counter-intuitive, 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.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
2秒前
阿喵完成签到,获得积分10
2秒前
天天快乐应助热心小松鼠采纳,获得10
5秒前
英俊的铭应助热心小松鼠采纳,获得30
5秒前
小蘑菇应助热心小松鼠采纳,获得10
5秒前
5秒前
Owen应助热心小松鼠采纳,获得10
5秒前
Jasper应助热心小松鼠采纳,获得10
5秒前
东北军完成签到 ,获得积分10
6秒前
无相完成签到 ,获得积分10
7秒前
杨旸发布了新的文献求助10
7秒前
7秒前
水工佬完成签到,获得积分10
9秒前
10秒前
13秒前
凤凰应助科研通管家采纳,获得80
19秒前
英勇的火应助科研通管家采纳,获得10
19秒前
SciGPT应助科研通管家采纳,获得10
19秒前
gjww应助科研通管家采纳,获得10
19秒前
lalala应助科研通管家采纳,获得10
19秒前
李健应助科研通管家采纳,获得30
19秒前
yummy小明8888完成签到 ,获得积分10
22秒前
23秒前
25秒前
碧蓝香芦完成签到 ,获得积分10
27秒前
学术小白完成签到,获得积分10
27秒前
缓慢雅青完成签到 ,获得积分10
29秒前
cherish完成签到,获得积分10
30秒前
脑洞疼应助枫桥夜泊采纳,获得10
31秒前
自由的中蓝完成签到 ,获得积分10
31秒前
35秒前
36秒前
蓝桉完成签到 ,获得积分10
38秒前
不吃芹菜完成签到,获得积分10
38秒前
辛勤香岚发布了新的文献求助10
39秒前
40秒前
武大帝77完成签到 ,获得积分10
40秒前
吉以寒完成签到,获得积分10
44秒前
草莓熊1215完成签到 ,获得积分10
45秒前
枫桥夜泊发布了新的文献求助10
46秒前
高分求助中
请在求助之前详细阅读求助说明!!!! 20000
The Three Stars Each: The Astrolabes and Related Texts 900
Yuwu Song, Biographical Dictionary of the People's Republic of China 700
Bernd Ziesemer - Maos deutscher Topagent: Wie China die Bundesrepublik eroberte 500
A radiographic standard of reference for the growing knee 400
Glossary of Geology 400
Additive Manufacturing Design and Applications 320
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2473891
求助须知:如何正确求助?哪些是违规求助? 2138919
关于积分的说明 5451163
捐赠科研通 1862910
什么是DOI,文献DOI怎么找? 926240
版权声明 562817
科研通“疑难数据库(出版商)”最低求助积分说明 495483