arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2208.02504cs.DScs.PF
收藏

共享乘车问题的计算复杂性研究

Exploring Computational Complexity Of Ride-Pooling Problems

Usman Akhtar, Rafal Kucharski

摘要:

拼车在计算上具有挑战性。可行乘坐的数量随着旅行者的数量和程度(车辆执行共享乘坐的能力)而增长,并迅速爆炸到使问题无法解析的大小。在实践中,应用搜索规则来限制搜索的数量,例如,最大的绕道和延迟,或者(就像我们在这项研究中使用的)有吸引力的游乐设施(绕道和延迟至少用折扣补偿)。然而,解决拼车的挑战仍然对问题设置非常敏感。在这里,我们将更详细地探讨它,并为这个开放的研究问题提供实验基础。我们跟踪的搜索空间的大小和计算时间需要解决乘车池问题的增长与不断增加的需求和更大的折扣提供池。我们在阿姆斯特丹运行了100多个实际实验,每小时行程请求10分钟,行程请求高达3600次,并跟踪使用ExMAS算法提出池化问题的解决方案是多么具有挑战性。我们观察到了强烈的非线性趋势,并确定了问题爆发的极限,我们的算法无法计算。值得注意的是,我们发现需求水平(旅行请求的数量)比折扣更重要。搜索空间呈指数级增长,并迅速达到巨大的水平。然而,超过一定程度,拼车问题的规模越大,拼车效率就越高。这为进一步减少搜索空间提供了机会。

英文摘要:

Ride-pooling is computationally challenging. The number of feasible rides grows with the number of travelers and the degree (capacity of the vehicle to perform a pooled ride) and quickly explodes to the sizes making the problem not solvable analytically. In practice, heuristics are applied to limit the number of searches, e.g., maximal detour and delay, or (like we use in this study) attractive rides (for which detour and delay are at least compensated with the discount). Nevertheless, the challenge to solve the ride-pooling remains strongly sensitive to the problem settings. Here, we explore it in more detail and provide an experimental underpinning to this open research problem. We trace how the size of the search space and computation time needed to solve the ride-pooling problem grows with the increasing demand and greater discounts offered for pooling. We run over 100 practical experiments in Amsterdam with 10-minute batches of trip requests up to 3600 trips per hour and trace how challenging it is to propose the solution to the pooling problem with our ExMAS algorithm. We observed strong, non-linear trends and identified the limits beyond which the problem exploded and our algorithm failed to compute. Notably, we found that the demand level (number of trip requests) is less critical than the discount. The search space grows exponentially and quickly reaches huge levels. However, beyond some level, the greater size of the ride-pooling problem does not translate into greater efficiency of pooling. Which opens the opportunity for further search space reductions.

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

↑