带汇合点的动态出租车共享的快速多对多路径规划
Fast Many-to-Many Routing for Dynamic Taxi Sharing with Meeting Points
AI总结:
针对动态出租车共享,本文改进在线插入式多对多路径算法,支持大量上下车点与汇合点,计算速度较此前最优方法快数倍,并可将运营成本降低至多15%。
摘要:
我们提出了一种用于动态出租车共享问题的改进算法,该问题指调度员为共享出租车车队进行调度,正如 UberXShare 和 Lyft Shared 等服务所采用的方式。我们对基础在线算法进行了加速,该算法会寻找将新客户插入一组现有路线的所有可能方式;我们推广了目标函数,并高效支持大量可能的上车点和下车点。这为具有更高车辆载客率的出租车共享系统奠定了算法基础,从而能够在服务质量相当的情况下大幅降低成本和生态影响。我们发现,与此前最先进的方法相比,我们的算法计算车辆与乘客之间分配的速度快数倍。此外,我们观察到,允许车辆和乘客使用汇合点可将车队运营成本降低至多 15%,同时还能减少乘客等待时间和行程时间。
英文摘要:
We introduce an improved algorithm for the dynamic taxi sharing problem, i.e. a dispatcher that schedules a fleet of shared taxis as it is used by services like UberXShare and Lyft Shared. We speed up the basic online algorithm that looks for all possible insertions of a new customer into a set of existing routes, we generalize the objective function, and we efficiently support a large number of possible pick-up and drop-off locations. This lays an algorithmic foundation for taxi sharing systems with higher vehicle occupancy - enabling greatly reduced cost and ecological impact at comparable service quality. We find that our algorithm computes assignments between vehicles and riders several times faster than a previous state-of-the-art approach. Further, we observe that allowing meeting points for vehicles and riders can reduce the operating cost of vehicle fleets by up to 15% while also reducing rider wait and trip times.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。