An efficient heuristic for estimating transportation network vulnerability
28 Jun 2011-pp 1092-1098
TL;DR: This model estimates the cost of single link failure based on the increase in shortest path travel time taking into account the effect of congestion, and shows 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.
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.
Citations
More filters
TL;DR: In this article, a comprehensive overview of the literature on transportation infrastructure system performance in disasters is provided, including those articles appearing in refereed journals, conference proceedings, and technical reports since the late 1990s that provide insights and tools for the assessment of anticipated transportation system performance, along with its management given the possibility of physical damage resulting from a future hazard event.
Abstract: This paper provides a comprehensive overview of the literature on transportation infrastructure system performance in disasters Specifically, it reviews those articles appearing in refereed journals, conference proceedings, and technical reports since the late 1990s that provide insights and tools for the assessment of anticipated transportation system performance, along with its management, given the possibility of physical damage resulting from a future hazard event In the considered literature, performance may be gauged under characteristics of risk, vulnerability, reliability, robustness, flexibility, survivability, and resilience, the most common concepts or measures in the literature In addition to providing an archive and synthesis of recent literature on this topic, the approximately 200 articles are classified based on a host of criteria, including applied measure (qualitative or quantitative), conceptual approach, and methodology
311 citations
TL;DR: In this paper , the authors provide insights regarding common elements and possible overlapping among the definitions of eleven RNP concepts (connectivity, redundancy, accessibility, reliability, connectivity reliability, travel time reliability, capacity reliability, flexibility, robustness, vulnerability, and resilience).
10 citations
TL;DR: A unifying framework for understanding and applying different robust network designs based on the context of traffic disturbances and design goals is introduced.
Abstract: Disturbances in roadway networks due to increases in demand or drops in network capacity can severely degrade the performance of the system. The robustness of a roadway network to such disturbances has been investigated using a variety of methods leading to disparate robust network designs. This paper introduces a unifying framework for understanding and applying different robust network designs based on the context of traffic disturbances and design goals. It presents the objectives, requirements and examples of robust network design with long-term (planning) and shortterm (operation) goals. A sample case study is presented to assess a short-term robust network design using traffic assignment. The preliminary testing results compared to conventional User Equilibrium and System Optimal traffic assignment, demonstrate 20% and 10% travel time savings with demand increase and supply reduction, respectively.
8 citations
TL;DR: A mathematical model for scheduling and routing restoration machines as well as relief vehicles is presented and a heuristic algorithm is provided to solve the problem of coordinating road network restoration and relief activities under the presence of heterogeneous types of roads disruptions.
Abstract: Disasters are likely to cause disruptions on transportation networks. Such disruptions have the potential of obstructing the performance of post-disaster relief operations, whose objective is to serve the affected population promptly. Therefore, it is important to develop strategic plans for restoring the transportation networks in the aftermath of a disaster. In this study, we address the problem of coordinating road network restoration and relief activities under the presence of heterogeneous types of roads disruptions. In this regard, we present a mathematical model for scheduling and routing restoration machines as well as relief vehicles. The approach seeks a restoration plan that is devoted to providing support to the relief operations. This implies prioritizing road rehabilitations taking into consideration their impact on the efficiency of relief activities. Additionally, we provide a heuristic algorithm to solve large instances of our problem for which commercial optimizers are insufficient. The approach is applied on a realistic case study based on the flooding which occurred in the Mojana region of northern Colombia in 2010–2011.
5 citations
09 Mar 2017
TL;DR: In this article, the authors show that there is no guarantee that a transportation network can deliver emergency services in a timely manner, and that it is one of several critical infrastructures on which first responders rely in order to deliver services.
Abstract: Transportation networks are one of several critical infrastructures on which first responders rely in order to deliver emergency services. However, there is no guarantee that a transportation netwo...
5 citations
References
More filters
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Abstract: We consider n points (nodes), some or all pairs of which are connected by a branch; the length of each branch is given. We restrict ourselves to the case where at least one path exists between any two nodes. We now consider two problems. Problem 1. Constrnct the tree of minimum total length between the n nodes. (A tree is a graph with one and only one path between every two nodes.) In the course of the construction that we present here, the branches are subdivided into three sets: I. the branches definitely assignec~ to the tree under construction (they will form a subtree) ; II. the branches from which the next branch to be added to set I, will be selected ; III. the remaining branches (rejected or not yet considered). The nodes are subdivided into two sets: A. the nodes connected by the branches of set I, B. the remaining nodes (one and only one branch of set II will lead to each of these nodes), We start the construction by choosing an arbitrary node as the only member of set A, and by placing all branches that end in this node in set II. To start with, set I is empty. From then onwards we perform the following two steps repeatedly. Step 1. The shortest branch of set II is removed from this set and added to
22,704 citations
"An efficient heuristic for estimati..." refers methods in this paper
...A shortest path from a source to a destination in a digraph with non-negative edge cost can easily be found using Dijkstra’s algorithm [2]....
[...]
TL;DR: In this paper, the authors consider a network interdiction problem in which an enemy attempts to maximize flow through a capacitated network while an interdictor tries to minimize this maximum flow by interdicting (stopping flow on) network arcs using limited resources.
537 citations
01 Jan 2003
TL;DR: This paper considers a problem in which an enemy attempts to maximize flow through a capacitated network while an interdictor tries to minimize this maximum flow by interdicting (stopping flow on) network arcs using limited resources.
Abstract: Interest in network interdiction has been rekindled because of attempts to reduce the flow of drugs and precursor chemicals moving through river and road networks in South America. This paper considers a problem in which an enemy attempts to maximize flow through a capacitated network while an interdictor tries to minimize this maximum flow by interdicting (stopping flow on) network arcs using limited resources. This problem is shown to be NP-complete even when the interdiction of an arc requires exactly one unit of resource. New, flexible, integer programming models are developed for the problem and its variations and valid inequalities and a reformulation are derived to tighten the LP relaxations of some of these models. A small computational example from the literature illustrates a hybrid (partly directed and partly undirected) model and the usefulness of the valid inequalities and the reformulation.
515 citations
"An efficient heuristic for estimati..." refers background in this paper
...The deterministic version of this problem was shown to be NP-complete [3]....
[...]
TL;DR: In this paper, the authors present a new, comprehensive, system-wide approach to identify critical links and evaluate network performance, which considers network flows, link capacity and network topology.
458 citations
"An efficient heuristic for estimati..." refers background in this paper
...[6] present a system-wide approach to evaluating network performance and identifying the critical links, taking into account network flows, link capacities and network topology....
[...]
TL;DR: In this paper, the authors introduce two new spatial optimization models called the r-interdiction median problem and the rinterdictation covering problem, which identify for a given service/supply system, that set of facilities that, if lost, would affect service delivery the most.
Abstract: Facilities and their services can be lost due to natural disasters as well as to intentional strikes, either by terrorism or an army. An intentional strike against a system is called interdiction. The geographical distribution of facilities in a supply or service system may be particularly vulnerable to interdiction, and the resulting impacts of the loss of one or more facilities may be substantial. Critical infrastructure can be defined as those elements of infrastructure that, if lost, could pose a significant threat to needed supplies (e.g., food, energy, medicines), services (e.g., police, fire, and EMS), and communication or a significant loss of service coverage or efficiency. In this article we introduce two new spatial optimization models called the r-interdiction median problem and the r-interdiction covering problem. Both models identify for a given service/supply system, that set of facilities that, if lost, would affect service delivery the most, depending upon the type of service protocol. These models can then be used to identify the most critical facility assets in a service/supply system. Results of both models applied to spatial data are also presented. Several solutions derived from these two interdiction models are presented in greater detail and demonstrate the degree to which the loss of one or more facilities disrupts system efficiencies or coverage. Recommendations for further research are also made.
380 citations
"An efficient heuristic for estimati..." refers methods in this paper
...Two variants of the interdiction problem were introduced by [5], namely the r-interdiction median problem (RIM) and the r-interdiction covering problem (RIC)....
[...]