In:
Naval Research Logistics (NRL), Wiley, Vol. 61, No. 8 ( 2014-12), p. 557-576
Abstract:
Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 557–576, 2014
Type of Medium:
Online Resource
ISSN:
0894-069X
,
1520-6750
Language:
English
Publisher:
Wiley
Publication Date:
2014
detail.hit.zdb_id:
392494-4
detail.hit.zdb_id:
207110-1
detail.hit.zdb_id:
1465691-7
SSG:
8
SSG:
3,2
Permalink
