SAFETYLIT WEEKLY UPDATE

We compile citations and summaries of about 400 new articles every week.
RSS Feed

HELP: Tutorials | FAQ
CONTACT US: Contact info

Search Results

Journal Article

Citation

Sullivan JL, Novak DC, Aultman-Hall L, Scott DM. Transp. Res. A Policy Pract. 2010; 44(5): 323-336.

Copyright

(Copyright © 2010, Elsevier Publishing)

DOI

10.1016/j.tra.2010.02.003

PMID

unavailable

Abstract

A wide range of relatively short-term disruptive events such as partial flooding, visibility reductions, traction hazards due to weather, and pavement deterioration occur on transportation networks on a daily basis. Despite being relatively minor when compared to catastrophes, these events still have profound impacts on traffic flow. To date there has been very little distinction drawn between different types of network-disruption studies and how the methodological approaches used in those studies differ depending on the specific research objectives and on the disruption scenarios being modeled.
In this paper, we advance a methodological approach that employs different link-based capacity-disruption values for identifying and ranking the most critical links and quantifying network robustness in a transportation network. We demonstrate how an ideal capacity-disruption range can be objectively determined for a particular network and introduce a scalable system-wide performance measure, called the Network Trip Robustness (NTR) that can be used to directly compare networks of different sizes, topologies, and connectivity levels. Our approach yields results that are independent of the degree of connectivity and can be used to evaluate robustness on networks with isolating links. We show that system-wide travel-times and the rank-ordering of the most critical links in a network can vary dramatically based on both the capacity-disruption level and on the overall connectivity of the network. We further show that the relationships between network robustness, the capacity-disruption level used for modeling, and network connectivity are non-linear and not necessarily intuitive. We discuss our findings with respect to Braess' Paradox.

NEW SEARCH


All SafetyLit records are available for automatic download to Zotero & Mendeley
Print