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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.