Shortest path network interdiction of bi-layer networks with goal threshold

Abstract

Important network attack and defense problems can be modeled as network interdiction. In this paper we propose a new threshold shortest-path network interdiction model (MIRGT) based on maximization shortest path problem, which minimizes the resources consumption while limiting the rival's network capacity to meet goal threshold. We then select a representative feedback dependency relation of multi-layer network, and propose the novel MIRGT-B bi-layer network interdiction model using logic constraint to replace the nonlinear constraint. Based on Benders decomposition and dual method, we give out two basic solution algorithms, and verify them on small-scale bi-layer networks.