An efficient heuristic for estimating transportation network vulnerability

  • Saleh Ibrahim
  • , Reda Ammar
  • , Sanguthevar Rajasekaran
  • , Nicholas Lownes
  • , Qixing Wang
  • , Dolly Sharma

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

Abstract

Estimating the criticality of each link in a transportation network is a crucial step for guiding the design and deployment of vulnerability reduction measures. Using exhaustive simulations based on user-equilibrium assignment to evaluate the effect of the failure of each link (or set of links) can be prohibitively time-consuming for reasonably-sized transportation networks. In this paper, we propose an alternative heuristic approach to the estimation the vulnerability of network links employing efficient graph-theoretical algorithms. In particular, our model estimates the cost of single link failure based on the increase in shortest path travel time taking into account the effect of congestion. Results show that the proposed method can reliably be used to estimate the relative effect of each link failure on the system travel time and rank links accordingly.

Original languageEnglish
Title of host publication16th IEEE Symposium on Computers and Communications, ISCC'11
Pages1092-1098
Number of pages7
DOIs
StatePublished - 2011
Externally publishedYes
Event16th IEEE Symposium on Computers and Communications, ISCC'11 - Corfu, Greece
Duration: Jun 28 2011Jul 1 2011

Publication series

NameProceedings - IEEE Symposium on Computers and Communications
ISSN (Print)1530-1346

Conference

Conference16th IEEE Symposium on Computers and Communications, ISCC'11
Country/TerritoryGreece
CityCorfu
Period06/28/1107/1/11

Keywords

  • transportation network vulnerability assessment

Fingerprint

Dive into the research topics of 'An efficient heuristic for estimating transportation network vulnerability'. Together they form a unique fingerprint.

Cite this