Modeling – path availability to support disaster vulnerability assessment of network infrastructure

Matisziw, Timothy C.; Murray, Alan T.

doi:10.1016/j.cor.2007.09.004

Cited by 164 publications

(66 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Kovács and Tatham (2009) examine the resource configurations of humanitarian versus military organizations in order to be able to respond to large-scale disruptions. Matisziw and Murray (2009) formulate a model to evaluate the disruption of arcs vital to network operations and apply it to the Ohio interstate highway system to support the assessment of disaster vulnerability.…”

Section: Literature Reviewmentioning

confidence: 99%

Risk approaches for delivering disaster relief supplies

2011

View full text Add to dashboard Cite

We consider the problem of designing the logistic system to assure adequate distribution of relief aid in a post-natural-disaster situation, when damages to infrastructure may disrupt the delivery of relief aid. The problem is formulated as a multi-objective optimization problem, encompassing three objective functions of central interest in such problems. The first objective function is a measure of risk (various forms of such risk are analyzed). The second objective function measures the coverage provided by the logistic system in the distribution of relief aid to disaster victims. The third objective function represents total travel time. We focus on the risk of delivery tours for relief supplies, where risk here captures the threat that potential tours become impassable after the natural hazard event. In order to cope with a range of different natural disasters and policy objectives, we develop five approaches emphasizing different measures of tour-dependent risk. To cover both earthquake and flood risks, we consider correlated as well as uncorrelated risk measures. We develop a two-phase solution approach to reflect the dictates of real-world disaster relief motivating this analysis. The first phase generates potentially Pareto-optimal solutions to the overall multi-objective logistic design problem with respect to three objectives. For any given risk measure, the first-phase design problem is formulated as a multi-objective integer program and a memetic algorithm is proposed as the solution approach. The second phase is an enrichment procedure to generate a broader range of potentially Pareto-optimal alternatives. The suggested approach is tested on real-world data from the province of Manabí in Ecuador and the results associated with the different risk measures are analyzed to illustrate the value of the proposed approach for the design of disaster relief networks.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Risk approaches for delivering disaster relief supplies

2011

View full text Add to dashboard Cite

show abstract

“…Theorem 1: Let Q β be the optimal objective of the QP problem (8)(9)(10)(11) and OPT β be the minimum β-edge disruptor of graph G = (V, E). Then, Q β ≤ OPT β for β ∈ [0, 1].…”

Section: Model and Definitionsmentioning

confidence: 99%

“…[3], [10]. Matisziw and Murray [9] first proposed the pairwise connectivity as an effective measurement and use mathematical programming to solve for exact solutions. Arulselvan et al later define the Critical Node/Edge problem problems, which the main objective is to identify top k nodes/links whose removal minimize the pairwise connectivity in the residual network, and provide NP-completeness proofs and integer programming formulations.…”

Section: Introductionmentioning

confidence: 99%

An efficient spectral bound for link vulnerability assessment in large-scale networks

Dinh

Shen

Thai

2012

MILCOM 2012 - 2012 IEEE Military Communications Conference

View full text Add to dashboard Cite

Abstract-Simultaneous attacks can cause devastating damage, breaking down communication networks into small fragments. To mitigate the risk and develop proactive responses, it is essential to assess the robustness of network in the worst-case scenarios. In this paper, we propose a spectral lower-bound on the number of removed links to incur a certain level of disruption in terms of pairwise connectivity. Our lower-bound explores the latent structural information in the network Laplacian spectrum, the set of eigenvalues of the Laplacian matrix, to provide guarantees on the robustness of the network against intentional attacks. Such guarantees often cannot be found in heuristic methods for identifying critical infrastructures. For the first time, the attackresistant proofs of large scale communication networks against link attacks are presented.

show abstract

“…A practical limitation of previous interdiction models for flow-based networks (Myung and Kim, 2004, Murray et al, 2007, Matisziw and Murray, 2009) is that the flow between two nodes is considered lost or unserved only if the two nodes are completely disconnected after interdiction. Although this assumption simplifies the mathematical representation of the problems and their solution, it also limits their practical applicability, especially to the context of transportation networks.…”

Section: Introductionmentioning

confidence: 99%

“…The authors propose a variable neighbourhood search algorithm to solve the model and test it on a case-study based on the Singapore rail transit system. Myung and Kim (2004), Murray et al (2007), and Matisziw and Murray (2009) study a flow interdiction problem on a network with multiple sources and destinations, where the system's value is measured in terms of the amount of demand that can still be served after interdiction. Scaparra et al (2015) build upon these models to devise a protection optimization model for railway systems.…”

Section: Introductionmentioning

confidence: 99%

Passenger railway network protection: a model with variable post-disruption demand service

Starita

Scaparra

2018

Journal of the Operational Research Society

View full text Add to dashboard Cite

Protecting transportation infrastructures is critical to avoid loss of life and to guard against economic upheaval. This paper addresses the problem of identifying optimal protection plans for passenger rail transportation networks, given a limited budget.We propose a bilevel protection model which extends and refines the model previously introduced by Scaparra et al. (2015). In our extension, we still measure the impact of rail disruptions in terms of the amount of unserved passenger demand. However, our model captures the post-disruption user behaviour in a more accurate way by assuming that passenger demand for rail services after disruptions varies with the extent of the travel delays. To solve this complex bi-level model, we develop a simulated annealing algorithm. The efficiency of the heuristic is tested on a set of randomly generated instances and compared with the one of a more standard exact decomposition algorithm.To illustrate how the modelling approach might be used in practice to inform protection planning decisions, we present a case study based on the London Underground. The case study also highlights the importance of capturing flow demand adjustments in response to increased travel time in a mathematical model.

show abstract

Modeling – path availability to support disaster vulnerability assessment of network infrastructure

Cited by 164 publications

References 27 publications

Risk approaches for delivering disaster relief supplies

Risk approaches for delivering disaster relief supplies

An efficient spectral bound for link vulnerability assessment in large-scale networks

Passenger railway network protection: a model with variable post-disruption demand service

Contact Info

Product

Resources

About