Robustness assessment of multimodal freight transport networks

Journal Article (2021)
Author(s)

Z. He (TU Delft - Network Architectures and Services)

Kumar Navneet (Student TU Delft)

Wirdmer van Dam (Rijkswaterstaat)

PFA van Mieghem (TU Delft - Network Architectures and Services)

Research Group
Network Architectures and Services
Copyright
© 2021 Z. He, Kumar Navneet, Wirdmer van Dam, P.F.A. Van Mieghem
DOI related publication
https://doi.org/10.1016/j.ress.2020.107315
More Info
expand_more
Publication Year
2021
Language
English
Copyright
© 2021 Z. He, Kumar Navneet, Wirdmer van Dam, P.F.A. Van Mieghem
Research Group
Network Architectures and Services
Volume number
207
Pages (from-to)
1-11
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

Multimodal freight transport allows switching among different modes of transport to utilize transport facilities more efficiently. This paper proposes an approach on network modeling and robustness assessment for multimodal freight transport networks, where the nodes represent junctions, terminals and crossings, and the links represent pathways. The network model captures the features of interconnection and interdependency. Freight can switch between different modalities at interconnected terminals, while disruption of a single interdependent node (e.g., bridge, tunnel, railway crossing) affects multiple modalities. Considering disruptions of infrastructure elements and capacity degradation of pathways as perturbations, the network robustness is evaluated as the increment of the total travel time caused by these perturbations. We apply our robustness assessment model to the Dutch freight transport, taking into account three modalities: inland waterway, road and railway. The node criticality, defined as the impact of a node removal on the total travel time, resembles a power-law distribution, independent of different traffic assignments. This scale-free property implies a relatively robust state of the network against single random disruptions. Further, we show that the most critical nodes can be roughly identified by their topological properties. Our research helps to schedule the maintenance by assigning priority to the critical infrastructure.