论文标题

量化运输网络中的导航复杂性

Quantifying navigation complexity in transportation networks

论文作者

Jiang, Zhuojun, Dong, Lei, Wu, Lun, Liu, Yu

论文摘要

随着城市地区的扩大,城市导航的复杂性有所增加,从而引发了许多有关网络可通道的研究的挑战性运输问题。但是,由于缺乏单个移动性数据,很少对Wayfinder的现实世界导航进行大规模的经验分析。在这里,使用来自中国三个主要城市的2.25亿个地铁旅行,我们从信息的角度量化了导航困难。我们的结果表明,1)人们保留了少数反复使用的路线,以及2)这些路线形成的子网中的导航信息要比全球网络中的理论值小得多,这表明实际旅行的决策成本明显小于先前研究中的理论上限。通过对不断增长的网络中的路由行为进行建模,我们表明,尽管全局网络变得难以导航,但可以在子网中提高导航性。我们进一步介绍了经验和理论搜索信息之间的普遍线性关系,这使两个指标可以互相预测。我们的发现表明,大规模观察可以量化现实世界的导航行为并有助于评估运输计划。

The complexity of navigation in cities has increased with the expansion of urban areas, creating challenging transportation problems that drive many studies on the navigability of networks. However, due to the lack of individual mobility data, large-scale empirical analysis of the wayfinder's real-world navigation is rare. Here, using 225 million subway trips from three major cities in China, we quantify navigation difficulty from an information perspective. Our results reveal that 1) people conserve a small number of repeatedly used routes, and 2) the navigation information in the subnetworks formed by those routes is much smaller than the theoretical value in the global network, suggesting that the decision cost for actual trips is significantly smaller than the theoretical upper limit found in previous studies. By modeling routing behaviors in growing networks, we show that while the global network becomes difficult to navigate, navigability can be improved in subnetworks. We further present a universal linear relationship between the empirical and theoretical search information, which allows the two metrics to predict each other. Our findings demonstrate how large-scale observations can quantify real-world navigation behaviors and aid in evaluating transportation planning.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源