Department of Management, Universitat Politècnica de Catalunya, Terrassa, Catalunya, Spain.
PLoS One. 2020 Dec 3;15(12):e0242875. doi: 10.1371/journal.pone.0242875. eCollection 2020.
Most complex network analyses of transportation systems use simplified static representations obtained from existing connections in a time horizon. In static representations, travel times, waiting times and compatibility of schedules are neglected, thus losing relevant information. To obtain a more accurate description of transportation networks, we use a dynamic representation that considers synced paths and that includes waiting times to compute shortest paths. We use the shortest paths to define dynamic network, node and edge measures to analyse the topology of transportation networks, comparable with measures obtained from static representations. We illustrate the application of these measures with a toy model and a real transportation network built from schedules of a low-cost carrier. Results show remarkable differences between measures of static and dynamic representations, demonstrating the limitations of the static representation to obtain accurate information of transportation networks.
大多数交通系统的复杂网络分析都使用简化的静态表示，这些静态表示是从时间范围内的现有连接中获得的。在静态表示中，旅行时间、等待时间和时间表的兼容性被忽略，从而丢失了相关信息。为了更准确地描述交通网络，我们使用动态表示，考虑同步路径并包括等待时间来计算最短路径。我们使用最短路径来定义动态网络、节点和边的度量，以分析交通网络的拓扑结构，这些度量与从静态表示中获得的度量具有可比性。我们使用一个玩具模型和一个由低成本航空公司的时间表构建的真实交通网络来说明这些度量的应用。结果表明，静态和动态表示的度量之间存在显著差异，这表明静态表示在获取交通网络的准确信息方面存在局限性。
