01506508

Component

https://doi.org/10.3141/2467-09

Several types of infrastructure networks such as transportation, utility, and pipeline systems may be subject to severe damage from exposure to human-caused and natural disasters (hurricanes, floods, earthquakes, etc.). Assessing the capability of a transportation network to provide basic functionality following catastrophic events involves estimating whether adequate connectivity can be ensured. In that context, this paper addresses the problem of identifying the path of maximum connectivity reliability between a pair of origin and destination nodes on a network subject to random and correlated arc connectivity failures. In view of the failure of the subpath optimality property for this maximum connectivity reliability problem, a reliability bounds–based sufficient condition for optimality is established. Based on this principle, a proposed algorithm estimates the reliability bounds by means of a candidate path set computed by using an efficient K shortest path algorithm. In the absence of convergence of the reliability bounds, an iterative gap reduction procedure is proposed to combine Monte Carlo simulation and network optimization to improve the lower bound by generating additional candidate paths. The proposed gap reduction and reliability evaluation procedures use a stochastic decomposition of the link failure propensity to improve computational efficiency. Empirical experiments on realistically sized synthetic networks show the proposed algorithm to be efficient and requiring limited path enumeration, and the experiments underscore the importance of modeling the correlations in link failures.

01559856

14-3823

English

pp 80–90

2014

Transportation Research Record: Journal of the Transportation Research Board

9780309295611

Print

Figures (4) ; References (21) ; Tables (2)

Algorithms; Connectivity; Emergency management; Monte Carlo method; Network links; Networks; Shortest path algorithms

Planning and Forecasting; Security and Emergencies; Transportation (General); I72: Traffic and Transport Planning

TRIS, TRB, ATRI

Jan 27 2014 3:19PM

• Complex Network Method of Evaluating Resilience in Surface Transportation Networks
• Equilibrium Analysis of Low-Conflict Network Designs
• Evaluation of a Strategic Road Pricing Scheme Accounting for Day-to-Day and Long-Term Demand Uncertainty
• How Many Runs? Analytical Method for Optimal Scenario Sampling to Estimate Travel Time Variance in Traffic Networks
• Integrated Planning of Tourism Investment and Transportation Network Design
• Modeling Parking Search on a Network by Using Stochastic Shortest Paths with History Dependence
• Modeling Transit and Intermodal Tours in a Dynamic Multimodal Network
• Optimal Bus Lane Infrastructure Design
• Optimizing Ridesharing Services for Airport Access
• Reducing Carbon Emissions with Multitrip Vehicle Mode
• Rollback Approach for Demand Consistency Checking of Real-Time Traffic Network State Estimation Models
• Sample-Based Algorithm to Determine Minimum Robust Cost Path with Correlated Link Travel Times
• Service Reliability–Based Transit Network Design with Stochastic Demand
• Short-Term Freeway Speed Profiling Based on Longitudinal Spatiotemporal Dynamics
• Simulation-Based Method for Finding Minimum Travel Time Budget Paths in Stochastic Networks with Correlated Link Times
• Urban Traffic State Explained by Road Networks and Spatial Variance: Approach Using Floating Car Data