Robust patrol strategies against attacks at dispersed heterogeneous locations
by Richard G. McGrath; Kyle Y. Lin
International Journal of Operational Research (IJOR), Vol. 30, No. 3, 2017

Abstract: We study a patrol problem where several patrollers move between heterogeneous locations dispersed throughout an area of interest in order to detect potential enemy attacks. To formulate an effective patrol policy, the patrollers must take into account travel time between locations, as well as location-specific attributes, such as time required for a patrol inspection, time required by an adversary to carry out an attack, and cost incurred due to an undetected attack. The patrol team wants to determine a robust patrol strategy that minimises the expected cost when, and if, an attack happens, regardless of where an intelligent enemy chooses to attack. For the case of a single patroller, we can compute the optimal solution via linear programming. For the case of multiple patrollers, we focus on efficient heuristic strategies based on set partitions and shortest paths.

Online publication date: Thu, 12-Oct-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com