Author
Listed:
- Samanta, Sukanya
- Sen, Goutam
- Uniyal, Jatin
- Ghosh, Soumya Kanti
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.
Suggested Citation
Samanta, Sukanya & Sen, Goutam & Uniyal, Jatin & Ghosh, Soumya Kanti, 2024.
"Assessing vehicle interdiction strategies on a complex transportation network: A simulation-based study,"
Socio-Economic Planning Sciences, Elsevier, vol. 95(C).
Handle:
RePEc:eee:soceps:v:95:y:2024:i:c:s0038012124002349
DOI: 10.1016/j.seps.2024.102035
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:soceps:v:95:y:2024:i:c:s0038012124002349. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/seps .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.