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

IF 1 Q3 MULTIDISCIPLINARY SCIENCES
E. Ayyıldız, Gökhan Özçelik, Cevriye Gencer, E. Demirci
{"title":"Providing homeland security strategies against interdictions in the city transportation network: A case study in Turkey","authors":"E. Ayyıldız, Gökhan Özçelik, Cevriye Gencer, E. Demirci","doi":"10.35378/gujs.1103774","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":12615,"journal":{"name":"gazi university journal of science","volume":null,"pages":null},"PeriodicalIF":1.0000,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"gazi university journal of science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.35378/gujs.1103774","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MULTIDISCIPLINARY SCIENCES","Score":null,"Total":0}
引用次数: 0

Abstract

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.
针对城市交通网络中的拦截提供国土安全策略:以土耳其为例
本文定义了一个受容多源多汇最短路径问题,并介绍了其扩展,称为受容多源多汇最短路径网络阻断问题(CMSSNIP)。CMSSNIP检查攻击者的行为,攻击者在某些地区造成事件后,试图最大化网络用户到达犯罪地点的总最短路径,以进行援助过程,为政府的防御系统提供战略信息。在这种情况下,提出了精确的数学模型,以确保网络用户安全路由的有用信息。这样,据作者所知,首次研究了由多源节点和多汇节点组成的CMSSNIP,并考虑了安全单元和犯罪地点之间的容量需求关系。因此,通过实际案例应用,基于拦截预算水平和犯罪地点数量考虑了一组场景,以显示模型的适用性。此外,通过计算实验对模型在不同规模网络上的性能进行了评价。在实际应用中,该模型提供了具有弹性的策略,可以在几秒钟内获得操作层面的安全最短路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
gazi university journal of science
gazi university journal of science MULTIDISCIPLINARY SCIENCES-
CiteScore
1.60
自引率
11.10%
发文量
87
期刊介绍: The scope of the “Gazi University Journal of Science” comprises such as original research on all aspects of basic science, engineering and technology. Original research results, scientific reviews and short communication notes in various fields of science and technology are considered for publication. The publication language of the journal is English. Manuscripts previously published in another journal are not accepted. Manuscripts with a suitable balance of practice and theory are preferred. A review article is expected to give in-depth information and satisfying evaluation of a specific scientific or technologic subject, supported with an extensive list of sources. Short communication notes prepared by researchers who would like to share the first outcomes of their on-going, original research work are welcome.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信