Identifying Critical Links in Transportation Networks Based on Route Diversity Redundancy

摘要

Transportation networks are one of the most critical urban lifeline systems. However, various incidents frequently occur, which degrade the transportation network's functions. Based on the concept of route diversity redundancy, this paper develops a new approach to identifying the critical links without the need of traffic re-assignment for each enumerated disruption scenario. Conceptually, the critical links are defined as those links included by more efficient paths (i.e., route diversity redundancy) of different origin-destination (O-D) pairs in a network. Considering the different criticality degrees of a link with respect to different O-D pairs, we introduce a mean-excess criticality probability (MECP) as a link aggregated criticality measure. To make the criticality measure applicable in large-scale networks, we further present a polynomial-time combinatorial algorithm for the efficient calculation. Numerical examples using two networks are provided to demonstrate the proposed approach for identifying critical links in transportation networks.