按需拼车效率的拓扑普适性
Topological universality of on-demand ride-sharing efficiency
摘要：
共享乘车可能大大有助于城市和农村地区符合未来的可持续流动性。拼车车队的服务质量共同取决于底层街道网络的拓扑结构、时空需求分布和调度算法。然而，乘车共享服务的效率通常通过经济或生态的临时措施来量化，这些措施不会转移到具有不同特征的新服务区域。在这里，我们得出了一个通用的措施，乘坐共享效率的基础上，内在的乘坐共享动力学，遵循一个通用的缩放律在网络拓扑结构。我们表明，相同的缩放持有不同的拓扑结构，包括城市，岛屿和农村地区的街道网络，是不敏感的修改请求分布和调度标准。这些结果进一步加深了我们对拼车车队集体动态的理解，并可能使我们能够对条件进行定量评估，以增加创建或将拼车服务转移到以前未提供服务的地区的可行性。
英文摘要：
Ride-sharing may substantially contribute to future-compliant sustainable mobility, both in urban and rural areas. The service quality of ride-sharing fleets jointly depends on the topology of the underlying street networks, the spatio-temporal demand distributions, and the dispatching algorithms. Yet, efficiency of ride-sharing services is typically quantified by economic or ecological ad-hoc measures that do not transfer to new service regions with different characteristics. Here we derive a generic measure of ride-sharing efficiency based on the intrinsic ride-sharing dynamics that follows a universal scaling law across network topologies. We demonstrate that the same scaling holds across street networks of distinct topologies, including cities, islands and rural areas, and is insensitive to modifying request distributions and dispatching criteria. These results further our understanding of the collective dynamics of ride-sharing fleets and may enable quantitative evaluation of conditions towards increasing the feasibility of creating or transferring ride-sharing services to previously unserviced regions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
