Design of A* based heuristic algorithm for efficient interdiction in multi-Layer networks

TL;DR

This paper introduces an A*-based heuristic algorithm for efficient interdiction in multi-layer networks, addressing dynamic crime environments with improved computational efficiency and solution quality.

Contribution

It proposes a layered graph representation and an A*- heuristic algorithm for near-optimal interdiction strategies in complex, dynamic networks.

Findings

The A*- heuristic outperforms MILP in computational speed.

The method achieves high-quality interdiction solutions.

It effectively handles large, dynamic transportation networks.

Abstract

Intercepting a criminal using limited police resources presents a significant challenge in dynamic crime environments, where the criminal's location continuously changes over time. The complexity is further heightened by the vastness of the transportation network. To tackle this problem, we propose a layered graph representation, in which each time step is associated with a duplicate of the transportation network. For any given set of attacker strategies, a near-optimal defender strategy is computed using the A-Star heuristic algorithm applied to the layered graph. The defender's goal is to maximize the probability of successful interdiction. We evaluate the performance of the proposed method by comparing it with a Mixed-Integer Linear Programming (MILP) approach used for the defender. The comparison considers both computational efficiency and solution quality. The results demonstrate that our approach effectively addresses the complexity of the problem and delivers high-quality solutions within a short computation time.