Joint optimizing network interdiction and emergency facility location in terrorist attacks

Xiang, Yin; Wei, Hang

doi:10.1016/j.cie.2020.106480

Cited by 15 publications

(3 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Furthermore, neither the implicit enumeration method nor Benders decomposition algorithms cannot be used effectively to solve the proposed model. This is because the lower-level program is a highly complicated nonlinear model (Xiang et al 2020). In order to solve the DMFNIAI problem (2-9), we propose a hybrid algorithm which is hereunder called the DM-PHA algorithm which is comprising of a two-phase Decomposition Method (DM) and the Progressive Hedging Algorithm (PHA).…”

Section: Solution Methods For Dmfniai (Dm-pha)mentioning

confidence: 99%

A maximum-flow network interdiction problem in an uncertain environment under information asymmetry condition: Application to smuggling goods

Mirzaei

Al-e-hashem

Shirazi

2021

Computers & Industrial Engineering

View full text Add to dashboard Cite

Section: Solution Methods For Dmfniai (Dm-pha)mentioning

confidence: 99%

A maximum-flow network interdiction problem in an uncertain environment under information asymmetry condition: Application to smuggling goods

Mirzaei

Al-e-hashem

Shirazi

2021

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…A leader–follower game with the State and the Terrorist was first modeled by Berman and Gavious (2007), in which the State as a leader decides the location of the facilities to minimize the worst‐case losses caused by a terrorist attack, and the Terrorist as follower strikes a city that incurs maximum damage. Xiang and Wei (2020) develop a novel defender–attacker model, that is, a bi‐level optimization problem, to integrate network interdiction with the facility location problem. To solve the model, the upper level variables are implicitly enumerated by a branch and bound algorithm, whereas an efficient vertex enumeration method is used to solve the lower level program.…”

Section: Related Workmentioning

confidence: 99%

A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information

Gan

et al. 2020

Int Trans Operational Res

View full text Add to dashboard Cite

Recently, locating emergency response facilities has been drawing increasing attention with the highly strategic nature of terrorist attacks. To this end, we present a game‐theoretic approach for the location of terror response facilities when both disruption risk and hidden information are taken into account. The game is described as a two‐stage game, in which the first stage allows the State, that is, defender, to locate the terror response facilities, including disclosed and undisclosed facilities, and assign them to the attacked city, while the second stage allows the terrorist, that is, attacker, to select one city to attack with partial information about facility location and assignment. We propose a mixed integer bi‐level nonlinear programming formulation, and in response, a heuristic algorithm is developed to find the equilibrium solution. Extensive computational tests on both synthetic data and a real‐world dataset of provincial capital cities in China demonstrate the effectiveness of the developed algorithm.

show abstract

“…The attacker knows that the user will choose the shortest route between two nodes they are familiar with, so they interdict travel on a subset of arcs by making those arcs more expensive. It is typical to presume that the interdictor has a restricted budget, which limits the amount of potential harm to a network [7,8].…”

Section: Introductionmentioning

confidence: 99%

Providing homeland security strategies against interdictions in the city transportation network: A case study in Turkey

Ayyıldız

Özçelik

Gencer

et al. 2023

Gazi University Journal of Science

View full text Add to dashboard Cite

This paper defines a capacitated multiple-source multiple-sink shortest path problem and introduces its extension, called the capacitated multiple-source multiple-sink shortest path network interdiction problem (CMSSNIP). CMSSNIP examines the actions of attackers who attempt to maximize the total shortest path of network users trying to reach the crime locations for the aid process after causing an incident in certain regions to provide strategic information for the defense systems of the government. In this context, the exact mathematical model ensuring useful information about safe routes to network users is proposed. In this manner, to the best knowledge of authors, the CMSSNIP consisting of multiple-source nodes and multiple-sink nodes and considering capacity-demand relations between security units and crime locations is studied for the first time. Accordingly, a set of scenarios is considered based on the interdiction budget levels and the number of crime locations through a real case application to show the applicability of the model. Furthermore, computational experiments are performed to evaluate the model performance on different-sized networks. It is realized that especially the model provides resilient strategies versus interdictions in terms of obtaining the safe shortest paths at the operational level within seconds in the real case application.

show abstract

Joint optimizing network interdiction and emergency facility location in terrorist attacks

Cited by 15 publications

References 43 publications

A maximum-flow network interdiction problem in an uncertain environment under information asymmetry condition: Application to smuggling goods

A maximum-flow network interdiction problem in an uncertain environment under information asymmetry condition: Application to smuggling goods

A game‐theoretic approach for the location of terror response facilities with both disruption risk and hidden information

Providing homeland security strategies against interdictions in the city transportation network: A case study in Turkey

Contact Info

Product

Resources

About