arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2005.11195cs.DS
收藏

一种基于动态树的按需拼车匹配算法

A Dynamic Tree Algorithm for On-demand Peer-to-peer Ride-sharing Matching

Rui Yao, Shlomo Bekhor

摘要:

创新的共享移动服务提供了按需灵活的移动选项,并有可能缓解交通拥堵。这些有吸引力的服务从不同的角度来看都具有挑战性。在这样的系统中的一个主要挑战是找到驾驶员和乘客之间关于系统目标和约束的合适的共乘匹配,并且向驾驶员提供最优的上下车顺序。在本文中,我们开发了一个有效的动态树算法,以找到最佳的皮卡和下车序列。该算法找到问题的初始解,跟踪先前探索的可行解,并在考虑新请求时减小解的搜索空间。此外,提出了一种有效的预处理过程来选择候选乘客请求,这进一步提高了算法的性能。在一个真实网络上进行了数值实验,以说明我们的算法的效率。敏感性分析表明,小的车辆容量和松散的额外旅行时间的限制,并不能保证整体节省车辆公里行驶。

英文摘要:

Innovative shared mobility services provide on-demand flexible mobility options and have the potential to alleviate traffic congestion. These attractive services are challenging from different perspectives. One major challenge in such systems is to find suitable ride-sharing matchings between drivers and passengers with respect to the system objective and constraints, and to provide optimal pickup and drop-off sequence to the drivers. In this paper, we develop an efficient dynamic tree algorithm to find the optimal pickup and drop-off sequence. The algorithm finds an initial solution to the problem, keeps track of previously explored feasible solutions, and reduces the solution search space when considering new requests. In addition, an efficient pre-processing procedure to select candidate passenger requests is proposed, which further improves the algorithm performance. Numerical experiments are conducted on a real size network to illustrate the efficiency of our algorithm. Sensitivity analysis suggests that small vehicle capacities and loose excess travel time constraints do not guarantee overall savings in vehicle kilometer traveled.

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

↑