IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v51y2019i10p1091-1109.html
   My bibliography  Save this article

A multi-objective, bilevel sensor relocation problem for border security

Author

Listed:
  • Aaron M. Lessin
  • Brian J. Lunday
  • Raymond R. Hill

Abstract

Consider a set of sensors having varying capabilities and respectively located to maximize an intruder’s minimal expected exposure to traverse a defended border region. Given two subsets of the sensors that have been respectively incapacitated or degraded, we formulate a multi-objective, bilevel optimization model to relocate surviving sensors to maximize an intruder’s minimal expected exposure to traverse a defended border region, minimize the maximum sensor relocation time, and minimize the total number of sensors requiring relocation. Our formulation also allows the defender to specify minimum preferential coverage requirements for high-value asset locations and emplaced sensors. Adopting the ε-constraint method for multi-objective optimization, we subsequently develop a single-level reformulation that enables the identification of non-inferior solutions on the Pareto frontier and, consequently, identifies trade-offs between the competing objectives. We demonstrate the aforementioned model and solution procedure for a scenario in which a defender is relocating surviving air defense assets to inhibit intrusion by a fixed-wing aircraft.

Suggested Citation

  • Aaron M. Lessin & Brian J. Lunday & Raymond R. Hill, 2019. "A multi-objective, bilevel sensor relocation problem for border security," IISE Transactions, Taylor & Francis Journals, vol. 51(10), pages 1091-1109, October.
  • Handle: RePEc:taf:uiiexx:v:51:y:2019:i:10:p:1091-1109
    DOI: 10.1080/24725854.2019.1576952
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2019.1576952
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2019.1576952?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Haywood, Adam B. & Lunday, Brian J. & Robbins, Matthew J. & Pachter, Meir N., 2022. "The weighted intruder path covering problem," European Journal of Operational Research, Elsevier, vol. 297(1), pages 347-358.

    More about this item

    Statistics

    Access and download statistics

    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:taf:uiiexx:v:51:y:2019:i:10:p:1091-1109. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.