按需共乘的拓扑依赖性
Topology dependence of on-demand ride-sharing
摘要：
交通在农村和城市地区都是一个挑战，带来了从拥堵到空气污染的负面影响。拼车是私家车的一个有吸引力的替代方案，它将公共交通的交通减少与私家车的灵活性和舒适性结合起来。在这里，我们研究的基础街道网络拓扑结构的可行性乘坐捆绑分析和模拟的影响。使用数值和分析方法，我们发现，系统性能可以衡量每辆车的预定停止的数量。它与请求率的缩放近似是线性的，并且取决于网络拓扑的斜率是该拓扑中拼车难易程度的度量。这种依赖性是由不同的增长的路线量，我们计算分析最简单的网络由一个单一的车辆。
英文摘要：
Traffic is a challenge in rural and urban areas alike with negative effects ranging from congestion to air pollution. Ride-sharing poses an appealing alternative to personal cars, combining the traffic-reducing ride bundling of public transport with much of the flexibility and comfort of personal cars. Here we study the effects of the underlying street network topology on the viability of ride bundling analytically and in simulations. Using numerical and analytical approaches we find that system performance can be measured in the number of scheduled stops per vehicle. Its scaling with the request rate is approximately linear and the slope, that depends on the network topology, is a measure of the ease of ridesharing in that topology. This dependence is caused by the different growth of the route volume, which we compute analytically for the simplest networks served by a single vehicle.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
