Data-Driven Policies for the Online Ride-Hailing Problem with Fairness

运筹学 业务 计算机科学 运输工程 经济 营销 工程类
作者
Shachaf Ben-Gal,Michal Tzur
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:59 (3): 647-669 被引量:5
标识
DOI:10.1287/trsc.2023.0068
摘要

Ride-hailing is a prevalent transportation service that facilitates mobility in urban areas. A ride-hailing service system encompasses several research problems, including the operational assignment of on-demand ride requests to vehicles in real time. The literature suggests various approaches to address similar systems, mainly optimizing the system efficiency, but recent studies pointed out that these systems are likely to cause geographical unfairness among passengers. Such unfairness may imply, for example, that requests whose origin or destination is far from centralized locations may suffer from excessive service rejections. In this paper, we suggest a data-driven approach to design an online assignment policy to overcome this phenomenon. We formulate the online ride-hailing problem with fairness that seeks to maximize both efficiency and geographical fairness in the system while achieving an adequate balance between them. To solve this problem, we offer a new general method to develop online assignment policies based on solutions for offline versions of the problem. The new method suggests extracting information from these solutions to guide real-time assignment decisions, which are chosen using a data-driven algorithm. With a simulation study, we examine the performance of our online policies relative to dispatching rules using synthetic random data that represent a real city layout and movement. Some of these rules are commonly used in practice, and some are more sophisticated ones. Our results demonstrate the viability of our approach to designing online policies. Compared with other dispatching rules, the experiments show that the generated policies maintain a better trade-off between efficiency and geographical fairness and preserve stable performance regardless of the instance size in different system settings. Funding: This research was partially supported by the Israel Science Foundation [Grant 2772/24]. S. Ben-Gal was partially supported by a scholarship from the Shlomo Shmeltzer Institute for Smart Transportation at Tel Aviv University and by The Israeli Smart Transportation Research Center. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2023.0068 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
rngay完成签到,获得积分10
1秒前
研友_VZG7GZ应助你知道qee吗采纳,获得10
1秒前
2秒前
无花果应助孙嘉畯采纳,获得10
2秒前
3秒前
aotine7完成签到,获得积分10
3秒前
zzx发布了新的文献求助60
3秒前
耀星发布了新的文献求助10
3秒前
星辰大海应助小机灵采纳,获得10
3秒前
ryl发布了新的文献求助10
3秒前
FashionBoy应助jason采纳,获得10
5秒前
7秒前
温暖的莞发布了新的文献求助10
7秒前
7秒前
传奇3应助long采纳,获得10
8秒前
田様应助薄年采纳,获得10
8秒前
taoyeeee完成签到,获得积分10
9秒前
NCS杀手完成签到,获得积分10
9秒前
djsj发布了新的文献求助100
9秒前
kommon完成签到,获得积分10
9秒前
nini发布了新的文献求助10
10秒前
美好丹妗完成签到,获得积分10
10秒前
TristanW完成签到,获得积分10
10秒前
kooooi完成签到,获得积分10
11秒前
无痛人刘完成签到,获得积分10
11秒前
美好丹妗发布了新的文献求助10
12秒前
13秒前
xiaoyu完成签到,获得积分10
13秒前
13秒前
13秒前
13秒前
maimai发布了新的文献求助10
14秒前
彭于晏应助yanbing_jiang采纳,获得10
14秒前
ryl完成签到,获得积分10
14秒前
hjw发布了新的文献求助10
14秒前
可爱的函函应助jiangjiang采纳,获得10
15秒前
15秒前
15秒前
16秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Römisch-Germanische Forschungen 1000
APA handbook of comparative psychology: Basic concepts, methods, neural substrate, and behavior 1000
China Pluperfect I: Epistemology of Past and Outside in Chinese Art 520
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The fast track to determining transfer functions of linear circuits: The student guide 500
The Analytical and Numerical Solution of Electric and Magnetic Fields 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7609644
求助须知:如何正确求助?哪些是违规求助? 9185254
关于积分的说明 19676167
捐赠科研通 7183281
什么是DOI,文献DOI怎么找? 3270272
关于科研通互助平台的介绍 2433970
邀请新用户注册赠送积分活动 2264783