arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1906.03394cs.AIcs.MA
收藏

基于极坐标的大规模动态拼车服务匹配策略

A Ride-Matching Strategy For Large Scale Dynamic Ridesharing Services Based on Polar Coordinates

Utah State University(犹他州立大学)

Jiyao Li, Vicki H. Allan

摘要:

本文研究了在不确定环境下如何实时的汇集多个拼车出行请求这一具有挑战性的问题。目标是更好的性能指标的效率和可接受的满意度的车手。为有效解决这一问题,提出了一种兼顾动态拼车服务收益和损失的目标函数。基于极坐标的乘坐匹配策略(PCRM),可以适应乘客在船上的满意度。在实验中,来自纽约市(NYC)的大规模数据集。我们做了一个案例研究,用135,252个出行请求的训练集来确定动态拼车服务的最佳参数集。此外,我们还使用包含427,799个行程请求的测试集和两种最先进的方法作为基线来估计我们方法的有效性。实验结果表明,与单人出行相比,拼车服务平均可节省38%的出行距离,近100%的乘客可以得到服务,每个乘客在拼车行程中仅花费3.8分钟。

英文摘要:

In this paper, we study a challenging problem of how to pool multiple ride-share trip requests in real time under an uncertain environment. The goals are better performance metrics of efficiency and acceptable satisfaction of riders. To solve the problem effectively, an objective function that compromises the benefits and losses of dynamic ridesharing service is proposed. The Polar Coordinates based Ride-Matching strategy (PCRM) that can adapt to the satisfaction of riders on board is also addressed. In the experiment, large scale data sets from New York City (NYC) are applied. We do a case study to identify the best set of parameters of the dynamic ridesharing service with a training set of 135,252 trip requests. In addition, we also use a testing set containing 427,799 trip requests and two state-of-the-art approaches as baselines to estimate the effectiveness of our method. The experimental results show that on average 38% of traveling distance can be saved, nearly 100% of passengers can be served and each rider only spends an additional 3.8 minutes in ridesharing trips compared to single rider service.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑