Optimal Allocation of Protective Resources in Shortest-Path Networks

Scaparra, Maria Paola and Cappanera, Paola (2008) Optimal Allocation of Protective Resources in Shortest-Path Networks. Working paper. University of Kent Canterbury, Canterbury

Abstract

We develop a game theoretic approach for allocating protection resources among the components of a network so as to maximize its robustness to external disruptions. Specifically, we consider shortest-path networks where disruptions may result in traffic flow delays through the affected components or in the complete loss of some elements. We develop a multi-level program which identifies the set of components to harden so as to minimize the length of the shortest path between a supply node and a demand node after a worst-case disruption of some unprotected components. We propose an implicit enumeration algorithm to solve the multi-level problem to optimality and streamline the approach by solving the lower level interdiction problem heuristically at each node of the enumeration tree. We also propose some variable fixing rules which reduce the dimension of the lower level problems. A thorough computational investigation demonstrates that the proposed solution method is able to identify optimal protection strategies for networks of significant size. We also study the sensitivity of the proposed approach to variations of the problem parameters, such as the level of offensive and defensive resources, and the distribution of the arc lengths and delays.

Item Type:	Monograph (Working paper)
Additional information:	Working Paper Number 177
Uncontrolled keywords:	Network interdiction, multi-level programming, shortest paths, resource allocation.
Subjects:	H Social Sciences > H Social Sciences (General)
Divisions:	Faculties > Social Sciences > Kent Business School > Management Science Faculties > Social Sciences > Kent Business School > Centre for Logistics and Heuristic Organisation (CLHO)
Depositing User:	Jennifer Knapp
Date Deposited:	08 Sep 2010 13:57 UTC
Last Modified:	28 May 2019 15:43 UTC
Resource URI:	https://kar.kent.ac.uk/id/eprint/25487 (The current URI for this page, for reference purposes)