Taxi-hailing platforms: Inform or Assign drivers?

目的地 匹配(统计) 运筹学 排队论 共享经济 集合(抽象数据类型) 计算机科学 运输工程 工程类 万维网 地理 旅游 计算机网络 统计 数学 考古 程序设计语言
作者
Luoyi Sun,Ruud H. Teunter,Guowei Hua,Tian Bao Wu
出处
期刊:Transportation Research Part B-methodological [Elsevier BV]
卷期号:142: 197-212 被引量:39
标识
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 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.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
Wcy发布了新的文献求助10
1秒前
茉笙发布了新的文献求助10
1秒前
1秒前
英俊的铭的应助被小懿采纳,获得10
1秒前
司望衡完成签到,获得积分10
1秒前
福建农林太学完成签到,获得积分20
1秒前
临风发布了新的文献求助10
2秒前
科研小哥的应助被全或无采纳,获得20
2秒前
ljq完成签到,获得积分10
2秒前
vina完成签到,获得积分10
2秒前
四零发布了新的文献求助30
3秒前
英姑的应助被指天采纳,获得10
3秒前
3秒前
3秒前
自渡发布了新的文献求助10
4秒前
笨笨行云完成签到,获得积分10
4秒前
NewMoon完成签到,获得积分10
4秒前
5秒前
5秒前
5秒前
duwang发布了新的文献求助10
5秒前
5秒前
5秒前
ZZ发布了新的文献求助10
6秒前
SciGPT的应助被Evan采纳,获得10
6秒前
6秒前
呆萌似狮完成签到,获得积分10
6秒前
Lo完成签到 ,获得积分10
6秒前
CipherSage的应助被一言采纳,获得10
6秒前
7秒前
black完成签到,获得积分10
7秒前
从容的文涛完成签到,获得积分10
7秒前
7秒前
Orange的应助被昏睡的柜子采纳,获得10
7秒前
luo完成签到,获得积分20
8秒前
甲谁完成签到 ,获得积分10
8秒前
8秒前
虚幻雨完成签到,获得积分10
9秒前
眯眯眼的一兰完成签到 ,获得积分10
9秒前
着急的焦发布了新的文献求助10
9秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
拉伸高分子熔体中缠结行为的模拟和小角中子散射研究 1500
The World Atlas of Wine 9th edition 1000
奈特基础组织学:配套组织病理学(第4版)(Netter's Essential Histology With Correlated Histopathology) 800
John McDowells Bildungstheorie 800
八旗制度の研究 600
Analyses de reconnaissances de dettes passées devant les échevins d'Ypres (1249-1291) 600
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 计算机科学 工程类 有机化学 化学工程 生物化学 物理 复合材料 内科学 催化作用 光电子学 人工智能 细胞生物学 无机化学 物理化学 数学
热门帖子
关注 科研通微信公众号,转发送积分 8159663
求助须知:如何正确求助?哪些是违规求助? 9555211
关于积分的说明 21725494
捐赠科研通 7749713
什么是DOI,文献DOI怎么找? 3427292
关于科研通互助平台的介绍 2552372
邀请新用户注册赠送积分活动 2471628