IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v30y2017i3p340-359.html
   My bibliography  Save this article

Robust patrol strategies against attacks at dispersed heterogeneous locations

Author

Listed:
  • Richard G. McGrath
  • Kyle Y. Lin

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.

Suggested Citation

  • Richard G. McGrath & Kyle Y. Lin, 2017. "Robust patrol strategies against attacks at dispersed heterogeneous locations," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 30(3), pages 340-359.
  • Handle: RePEc:ids:ijores:v:30:y:2017:i:3:p:340-359
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=87276
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Darlington, Matthew & Glazebrook, Kevin D. & Leslie, David S. & Shone, Rob & Szechtman, Roberto, 2023. "A stochastic game framework for patrolling a border," European Journal of Operational Research, Elsevier, vol. 311(3), pages 1146-1158.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:30:y:2017:i:3:p:340-359. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.