arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2011.02601cs.DS
收藏

快速、精确、可扩展的动态拼车

Fast, Exact and Scalable Dynamic Ridesharing

Valentin Buchhold, Peter Sanders, Dorothea Wagner

摘要:

我们研究了通过调度一组共享车辆来服务一组乘车请求的问题,这是Uber和Lyft等乘车共享公司所面临的问题。大规模解决这个问题可能是未来有效使用大型自动驾驶汽车的关键。由于为整个请求集找到一个最小化总驾驶时间的解决方案是NP完全的,因此大多数实用的方法都是逐个处理请求。每个请求被插入到任何车辆的路线中,使得驾驶时间的增加最小化。虽然该变体在多项式时间内是可解的,但是在当前实现中,即使当使用不精确的滤波算法时,它仍然花费相当多的时间。在这项工作中,我们提出了一种新的算法,找到最好的插入,基于(可定制的)收缩层次结构与本地桶。我们的算法找到了可证明的精确解,仍然比目前工业界和学术界使用的最先进算法快30倍,并且扩展性更好。在迭代运输模拟中使用时,我们的算法减少了大规模场景的模拟时间,从几天到几个小时的许多请求。

英文摘要:

We study the problem of servicing a set of ride requests by dispatching a set of shared vehicles, which is faced by ridesharing companies such as Uber and Lyft. Solving this problem at a large scale might be crucial in the future for effectively using large fleets of autonomous vehicles. Since finding a solution for the entire set of requests that minimizes the total driving time is NP-complete, most practical approaches process the requests one by one. Each request is inserted into any vehicle's route such that the increase in driving time is minimized. Although this variant is solvable in polynomial time, it still takes considerable time in current implementations, even when inexact filtering heuristics are used. In this work, we present a novel algorithm for finding best insertions, based on (customizable) contraction hierarchies with local buckets. Our algorithm finds provably exact solutions, is still 30 times faster than a state-of-the-art algorithm currently used in industry and academia, and scales much better. When used within iterative transport simulations, our algorithm decreases the simulation time for largescale scenarios with many requests from days to hours.

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

↑