Stochastic shortest path network interdiction with a case study of Arizona–Mexico border

Zhang, Jing; Zhuang, Jun; Behlendorf, Brandon

doi:10.1016/j.ress.2017.10.026

Cited by 29 publications

(16 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Guillot and Stauffer (2018) extend Dijkstra's algorithm for the stochastic SP problem in finite state and action spaces. Zhang et al (2018) study the issue of border security in terms of resource allocation, and formed the problem as stochastic SP network interdiction models. Ahmadi et al (2018) Similarly, fuzzy theory can be used to uncertainty analysis with imprecise weights in SP problem.…”

Section: Literature Reviewmentioning

confidence: 99%

An acceptability index based approach for solving shortest path problem on a network with interval weights

Ebrahimnejad

2021

RAIRO-Oper. Res.

View full text Add to dashboard Cite

Based on the acceptability index for comparison of any two imprecise values, efficient algorithms have been proposed in the literature for solving shortest path (SP) problem when the weights of connected arcs in a transportation network are represented as interval numbers. In this study, a generalized Dijkstra algorithm is proposed to handle the SP problem with interval weights. Here it is shown that once the acceptability index is chosen, the interval SP problem is converted into crisp one, which is easily solved by the standard SP algorithms. The main contribution here is the reduction of the computational complexity of the existing algorithm for solving interval SP problem. To show the advantages of the proposed algorithm over existing algorithm the numerical example presented in literature is solved using the proposed algorithm and the obtained results are discussed. Moreover, an small sized telecommunication network is provided to illustrate the potential application of the proposed method. Finally, the practical relevance of the proposed algorithm is evaluated by means of a large scale pilot case where a pharmaceutical shipment between the cities in Iran should be transported.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

An acceptability index based approach for solving shortest path problem on a network with interval weights

Ebrahimnejad

2021

RAIRO-Oper. Res.

View full text Add to dashboard Cite

show abstract

“…Magliocca et al [14] consider counter-drug interdiction to disrupt the cocaine distribution. Zhang et al [15] study the stochastic shortest-path interdiction problem using probabilistic detection likelihood to solve Ports-of-Entry problem; such as human trafficking, illegal drug distribution, and terrorism. Fang et al [16] develop a framework for the electrical power grid interdiction that balances the difficulties in predicting the hazard with the over conservatism in the attacker-defender models.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimal k Cut-Sets in Attack/Defense Strategies on Networks

et al. 2020

View full text Add to dashboard Cite

The paper investigates the most critical k cut-sets to target in the context of attacks on networks. The targeted network fails if the attack successfully disables a full cut-set. The attack process is dynamic and targets one link at a time. We assume perfect information, so that the attacker picks the next link to target after identifying the outcome of the attack on the previous one. The attack may continue to reach up to k cut-sets. The problem is to identify which cut-sets to target (referred to as the k-critical cut-sets of the network) that maximize the probability of a successful attack. We distinguish both cases of disjoint and non-disjoint cut-sets. We develop an algorithm for each case with illustrations. We explore the large scale of networks and offer guidelines on the corresponding defensive strategies. INDEX TERMS cut-set, defense, interdiction networks, multiple-attacks, path-set.

show abstract

“…Above all, multi‐attacker is the most important consideration and therefore an extended literature review of multiple‐attacker games is presented in the following sections. For the completeness of the literature review, some notable multi‐period, multi‐target, and risk preference models are briefly referred (Hausken & Zhuang, ; Jose & Zhuang, ; Payyappalli, Zhuang, & Jose, ; Shan & Zhuang, ; Zhang, Zhuang, & Jose, ; Zhang, Zhuang, & Behlendorf, ).…”

Section: Introductionmentioning

confidence: 99%

A Study on a Sequential One‐Defender‐N‐Attacker Game

Xu¹,

Zhuang²

2019

Risk Analysis

Self Cite

View full text Add to dashboard Cite

Government usually faces threat from multiple attackers. However, in the literature, researchers often model attackers as one monolithic player who chooses whether to attack, how much investment to spend, and on which target, instead of treating multiple attackers as independent agents. This modeling strategy may potentially cause suboptimal defense investment if the attackers have vastly different interests and preferences and may not be combined as one in theory. In this article, we develop a sequential game with complete information. This model considers one defender explicitly dealing with multiple unmergeable attackers. Thorough numerical experiments are conducted using ratio and exponential contest success functions under different scenarios. The result is also contrasted with the corresponding single attacker model to study the effect of mishandling multiple attackers. The propositions and observations drawn from the numerical experiments provide insights for government decision making with a better understanding of the attackers' behavior.

show abstract

Stochastic shortest path network interdiction with a case study of Arizona–Mexico border

Cited by 29 publications

References 35 publications

An acceptability index based approach for solving shortest path problem on a network with interval weights

An acceptability index based approach for solving shortest path problem on a network with interval weights

Optimal k Cut-Sets in Attack/Defense Strategies on Networks

A Study on a Sequential One‐Defender‐N‐Attacker Game

Contact Info

Product

Resources

About