Satisficing Approach to On-Demand Ride Matching

满意选择 匹配(统计) 数学优化 运筹学 计算机科学 经济 数理经济学 数学 微观经济学 统计
作者
Dongling Rong,Xinyu Sun,Meilin Zhang,Shuangchi He
出处
期刊:Informs Journal on Computing 卷期号:37 (2): 413-427 被引量:2
标识
DOI:10.1287/ijoc.2021.0210
摘要

Online ride-hailing platforms have developed into an integral part of the transportation infrastructure in many countries. The primary task of a ride-hailing platform is to match trip requests to drivers in real time. Although both passengers and drivers prefer a prompt pickup to initiate the trips, it is often difficult to find a nearby driver for every passenger. If the driver is far from the pickup point, the passenger may cancel the trip while the driver is heading toward the pickup point. For the platform to be profitable, the trip cancellation rate must be maintained at a low level. We propose a computationally efficient data-driven approach to ride matching, in which a pickup time target is imposed on each trip request and an optimization problem is formulated to maximize the joint probability of all the pickup times meeting the targets. By adjusting pickup time targets individually, this approach may assign more high-value trip requests to nearby drivers, thus boosting the platform’s revenue while maintaining a low cancellation rate. In numerical experiments, the proposed approach outperforms several ride-matching policies used in practice. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms—Discrete. Funding: This work of D. Rong and X. Sun was supported in part by the National Natural Science Foundation of China [Grant 71971165], the National Key Research and Development Program of China [Grant 2021YFB3301801], the MOE Project of Humanities and Social Science of China [Grant 19YJE630002], and the Soft Science Research Program of Shannxi [Grant 2018KRZ005]. The work of S. He was supported in part by the Singapore Ministry of Education Social Science Research Council [Grant MOE2022-SSRTG-029]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2021.0210 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2021.0210 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
lv完成签到,获得积分10
1秒前
2秒前
3秒前
奋斗VS发布了新的文献求助10
3秒前
共享精神应助winwing采纳,获得10
4秒前
吴彦祖完成签到,获得积分10
6秒前
7秒前
zhangyu完成签到,获得积分10
7秒前
今后应助月星采纳,获得100
7秒前
8秒前
8秒前
结实半邪完成签到 ,获得积分10
8秒前
8秒前
wen发布了新的文献求助30
9秒前
淡定的蜜蜂完成签到 ,获得积分10
10秒前
天真的千雁完成签到,获得积分10
10秒前
好运6连发布了新的文献求助10
10秒前
瘦瘦麦片完成签到,获得积分20
10秒前
54687完成签到,获得积分10
10秒前
大有叔发布了新的文献求助10
11秒前
jjf发布了新的文献求助30
11秒前
小爪冰凉发布了新的文献求助10
12秒前
共享精神应助yixuanshi采纳,获得10
12秒前
脑洞疼应助纯真玉兰采纳,获得10
13秒前
pluto应助细心健柏采纳,获得20
13秒前
科研通AI6应助灯灯采纳,获得10
14秒前
可爱的函函应助丁莞采纳,获得10
14秒前
阔达凝天发布了新的文献求助10
15秒前
量子星尘发布了新的文献求助10
16秒前
rationality完成签到,获得积分10
16秒前
天天快乐应助靓丽初蓝采纳,获得10
17秒前
清秀尔竹完成签到 ,获得积分10
17秒前
billkin完成签到,获得积分10
17秒前
18秒前
大个应助辛勤面包采纳,获得10
18秒前
18秒前
星辰大海应助坚定的苑睐采纳,获得10
20秒前
DRFANG完成签到,获得积分10
20秒前
20秒前
文静的摩托完成签到,获得积分10
20秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Basic And Clinical Science Course 2025-2026 3000
Encyclopedia of Agriculture and Food Systems Third Edition 2000
人脑智能与人工智能 1000
花の香りの秘密―遺伝子情報から機能性まで 800
Principles of Plasma Discharges and Materials Processing, 3rd Edition 400
Pharmacology for Chemists: Drug Discovery in Context 400
热门求助领域 (近24小时)
化学 材料科学 生物 医学 工程类 计算机科学 有机化学 物理 生物化学 纳米技术 复合材料 内科学 化学工程 人工智能 催化作用 遗传学 数学 基因 量子力学 物理化学
热门帖子
关注 科研通微信公众号,转发送积分 5608203
求助须知:如何正确求助?哪些是违规求助? 4692781
关于积分的说明 14875613
捐赠科研通 4716881
什么是DOI,文献DOI怎么找? 2544093
邀请新用户注册赠送积分活动 1509086
关于科研通互助平台的介绍 1472795