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

带会合点的在线拼车 [技术报告]

Online Ridesharing with Meeting Points [Technical Report]

Jiachuan Wang, Peng Cheng, Libin Zheng, Lei Chen, Wenjie Zhang

AI总结:

本文针对带会合点的在线拼车问题,提出基于便利性的会合点选择、HMPO 图加速和 SMDB 算法,并通过实验验证其有效性与效率。

摘要:

如今,拼车成为一种流行的通勤方式。动态到达的乘客发布他们的出发地和目的地,然后平台指派司机为他们服务。在拼车中,如果不同乘客的行程可以共享公共路线,则可以由一名司机服务。最近,许多拼车公司(例如滴滴和优步)进一步提出了一种新模式,即“带会合点的拼车”。具体而言,乘客只需步行较短距离并支付较少费用,就可以分别在其出发地和目的地附近被接载和送达。此外,会合点使司机的路线规划更加灵活,这有可能提高系统的全局收益。在本文中,我们首先正式定义了基于会合点的在线拼车问题(MORP)。我们证明了 MORP 是 NP 难的,并且不存在具有常数竞争比的多项式时间确定性算法。我们注意到一种顶点集结构,即 $k$-skip cover,非常适合 MORP。$k$-skip cover 倾向于找到方便乘客和司机往来的顶点(会合点)。借助会合点,MORP 倾向于通过这些方便的顶点服务更多乘客。基于这一思想,我们引入了一种基于便利性的会合点候选选择算法。我们进一步提出了一种分层会合点导向图(HMPO 图),该图对顶点进行指派有效性排序,并构造 $k$-skip cover 以加速整个指派过程。最后,我们利用 $k$-skip cover 点在拼车中的优点,提出了一种新算法,即 SMDB,来解决 MORP。在真实和合成数据集上的大量实验验证了我们算法的有效性和效率。

英文摘要:

Nowadays, ridesharing becomes a popular commuting mode. Dynamically arriving riders post their origins and destinations, then the platform assigns drivers to serve them. In ridesharing, different groups of riders can be served by one driver if their trips can share common routes. Recently, many ridesharing companies (e.g., Didi and Uber) further propose a new mode, namely "ridesharing with meeting points". Specifically, with a short walking distance but less payment, riders can be picked up and dropped off around their origins and destinations, respectively. In addition, meeting points enables more flexible routing for drivers, which can potentially improve the global profit of the system. In this paper, we first formally define the Meeting-Point-based Online Ridesharing Problem (MORP). We prove that MORP is NP-hard and there is no polynomial-time deterministic algorithm with a constant competitive ratio for it. We notice that a structure of vertex set, $k$-skip cover, fits well to the MORP. $k$-skip cover tends to find the vertices (meeting points) that are convenient for riders and drivers to come and go. With meeting points, MORP tends to serve more riders with these convenient vertices. Based on the idea, we introduce a convenience-based meeting point candidates selection algorithm. We further propose a hierarchical meeting-point oriented graph (HMPO graph), which ranks vertices for assignment effectiveness and constructs $k$-skip cover to accelerate the whole assignment process. Finally, we utilize the merits of $k$-skip cover points for ridesharing and propose a novel algorithm, namely SMDB, to solve MORP. Extensive experiments on real and synthetic datasets validate the effectiveness and efficiency of our algorithms.

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

↑