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

Authors : Ertuğrul Ayyildiz, Gökhan Özçelik, Cevriye Gencer, Emrullah Demirci

Pages : 1601-1623

Doi:10.35378/gujs.1103774

View : 283 | Download : 433

Publication Date : 2023-12-01

Article Type : Research Paper

Abstract :This study 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 is proposed to ensure useful information about safe routes to network users. 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. Consequently, a set of scenarios is considered based on the levels of the interdiction budget 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 performance of the model in networks of different sizes. It is realized that the model provides resilient strategies against interdictions in terms of obtaining the safe shortest paths at the operational level within seconds in the real case applications.
Keywords : Shortest path problem, Network interdiction, Mixed integer programming, Networks