BriefGPT.xyz
Mar, 2025
优化乘车拼购彩票的调度灵活性
Optimizing Ride-Pooling Operations with Extended Pickup and Drop-Off Flexibility
HTML
PDF
Hao Jiang, Yixing Xu, Pradeep Varakantham
TL;DR
本文针对乘车拼车服务中乘客上下车位置的限制进行了研究,提出了一种新颖的匹配方法,通过扩展乘客的上下车区域,来优化乘车拼车运营。研究发现,该方法能够提高服务请求的满足率达13%,并将平均行程距离减少21%,显著提升了乘车拼车服务的效率。
Abstract
The Ride-Pool
Matching Problem
(RMP) is central to on-demand
Ride-Pooling
services, where vehicles must be matched with multiple requests while adhering to service constraints such as pickup delays, detour limits
→