Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/ISCC.2011.5983988 | ISCC |
Keywords | Field | DocType |
vulnerability reduction measure,transportation network,transportation network vulnerability,crucial step,shortest path travel time,reasonably-sized transportation network,single link failure,alternative heuristic approach,efficient heuristic,relative effect,system travel time,link failure,failure analysis,graph theory,correlation,transportation,algorithm design,shortest path,terrorism,vulnerability assessment,computer model,algorithm design and analysis,throughput,computational modeling | Graph theory,Flow network,Heuristic,Software deployment,Algorithm design,Shortest path problem,Computer science,Computer network,Throughput,Distributed computing,Vulnerability | Conference |
ISSN | Citations | PageRank |
1530-1346 | 1 | 0.37 |
References | Authors | |
1 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Ibrahim | 1 | 29 | 5.07 |
| R. Ammar | 2 | 1 | 0.37 |
| Sanguthevar Rajasekaran | 3 | 1508 | 190.34 |
| N. Lownes | 4 | 1 | 0.37 |
| Q. Wang | 5 | 1 | 0.37 |
| D. Sharma | 6 | 1 | 0.37 |