Assessing vehicle interdiction strategies on a complex transportation network: A simulation-based study

IF 6.2 2区 经济学 Q1 ECONOMICS
Sukanya Samanta , Goutam Sen , Jatin Uniyal , Soumya Kanti Ghosh
{"title":"Assessing vehicle interdiction strategies on a complex transportation network: A simulation-based study","authors":"Sukanya Samanta ,&nbsp;Goutam Sen ,&nbsp;Jatin Uniyal ,&nbsp;Soumya Kanti Ghosh","doi":"10.1016/j.seps.2024.102035","DOIUrl":null,"url":null,"abstract":"<div><p>The escape interdiction problem within the context of attacker activities on a transportation network is addressed in this study. In the absence of traffic within the network, the attacker attempts to flee the city by choosing one of the shortest paths from the crime scene to a randomly selected exit point. However, in the presence of traffic, the attacker strategically selects the optimal route that minimizes his time to reach a randomly selected exit point. On the other side, defenders try to interdict the attacker on his escape route. Defenders face the daunting challenge of interdicting the attacker’s escape route while operating under limited resources. Dealing with a real city road network further adds complexity to the scenario. A simulation-based model is proposed for the optimal allocation of resources to tackle this issue. The focus then shifts to the development of an advanced search strategy that involves routing with optimal resource allocation. This paper presents the first comparative study for escape interdiction problems within a simulation environment, explicitly focusing on solution methodologies. An optimal resource allocation approach is proposed in the presence of traffic, constituting a novel contribution that has not been previously implemented in escape interdiction problems. In addition, the paper introduces a Genetic Algorithm (GA)-based meta-heuristic approach within a simulation environment. This approach generates optimal paths for defenders, wherein each node is associated with a fixed time window, representing the defender’s waiting time. In this proposed methodology, defenders undertake a tour of the network rather than remaining stationary at a single location. This approach expands the network search capabilities, thereby requiring optimization to ascertain the optimal routes and schedules for the defender vehicles. A case study is conducted using the map of IIT Kharagpur, India, to evaluate the effectiveness of this approach. By employing this approach and conducting in-depth analyses, the aim is to provide valuable insights into the efficiency and practicality of the developed methods on real-world transportation networks.</p></div>","PeriodicalId":22033,"journal":{"name":"Socio-economic Planning Sciences","volume":"95 ","pages":"Article 102035"},"PeriodicalIF":6.2000,"publicationDate":"2024-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Socio-economic Planning Sciences","FirstCategoryId":"96","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0038012124002349","RegionNum":2,"RegionCategory":"经济学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 0

Abstract

The escape interdiction problem within the context of attacker activities on a transportation network is addressed in this study. In the absence of traffic within the network, the attacker attempts to flee the city by choosing one of the shortest paths from the crime scene to a randomly selected exit point. However, in the presence of traffic, the attacker strategically selects the optimal route that minimizes his time to reach a randomly selected exit point. On the other side, defenders try to interdict the attacker on his escape route. Defenders face the daunting challenge of interdicting the attacker’s escape route while operating under limited resources. Dealing with a real city road network further adds complexity to the scenario. A simulation-based model is proposed for the optimal allocation of resources to tackle this issue. The focus then shifts to the development of an advanced search strategy that involves routing with optimal resource allocation. This paper presents the first comparative study for escape interdiction problems within a simulation environment, explicitly focusing on solution methodologies. An optimal resource allocation approach is proposed in the presence of traffic, constituting a novel contribution that has not been previously implemented in escape interdiction problems. In addition, the paper introduces a Genetic Algorithm (GA)-based meta-heuristic approach within a simulation environment. This approach generates optimal paths for defenders, wherein each node is associated with a fixed time window, representing the defender’s waiting time. In this proposed methodology, defenders undertake a tour of the network rather than remaining stationary at a single location. This approach expands the network search capabilities, thereby requiring optimization to ascertain the optimal routes and schedules for the defender vehicles. A case study is conducted using the map of IIT Kharagpur, India, to evaluate the effectiveness of this approach. By employing this approach and conducting in-depth analyses, the aim is to provide valuable insights into the efficiency and practicality of the developed methods on real-world transportation networks.

评估复杂交通网络中的车辆拦截策略:基于模拟的研究
本研究探讨了交通网络中攻击者活动背景下的逃逸拦截问题。在网络内没有交通的情况下,攻击者试图选择一条从犯罪现场到随机选择的出口点的最短路径逃离城市。然而,在有交通流量的情况下,攻击者会战略性地选择最优路径,使其到达随机选择的出口点的时间最小化。另一方面,防御者试图在攻击者逃跑的路线上对其进行拦截。防守方面临着严峻的挑战,即在资源有限的情况下阻截攻击方的逃跑路线。真实的城市路网进一步增加了这一场景的复杂性。为解决这一问题,我们提出了一个基于仿真的资源优化分配模型。然后,重点转向开发一种先进的搜索策略,其中包括资源优化分配的路由选择。本文首次在仿真环境中对逃生拦截问题进行了比较研究,并明确将重点放在解决方法上。本文提出了一种存在交通流量的最优资源分配方法,这是一种新颖的贡献,以前从未在逃逸拦截问题中实施过。此外,本文还在模拟环境中引入了一种基于遗传算法(GA)的元启发式方法。这种方法为防御者生成最优路径,其中每个节点都与一个固定的时间窗口相关联,代表防御者的等待时间。在这种建议的方法中,防御者对网络进行巡视,而不是固定在一个位置。这种方法扩大了网络搜索能力,因此需要进行优化,以确定防御者车辆的最佳路线和时间表。我们利用印度哈拉格浦尔理工大学的地图进行了案例研究,以评估这种方法的有效性。通过采用这种方法并进行深入分析,旨在就所开发方法在现实世界交通网络中的效率和实用性提供有价值的见解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Socio-economic Planning Sciences
Socio-economic Planning Sciences OPERATIONS RESEARCH & MANAGEMENT SCIENCE-
CiteScore
9.40
自引率
13.10%
发文量
294
审稿时长
58 days
期刊介绍: Studies directed toward the more effective utilization of existing resources, e.g. mathematical programming models of health care delivery systems with relevance to more effective program design; systems analysis of fire outbreaks and its relevance to the location of fire stations; statistical analysis of the efficiency of a developing country economy or industry. Studies relating to the interaction of various segments of society and technology, e.g. the effects of government health policies on the utilization and design of hospital facilities; the relationship between housing density and the demands on public transportation or other service facilities: patterns and implications of urban development and air or water pollution. Studies devoted to the anticipations of and response to future needs for social, health and other human services, e.g. the relationship between industrial growth and the development of educational resources in affected areas; investigation of future demands for material and child health resources in a developing country; design of effective recycling in an urban setting.
×
引用
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学术官方微信