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

Asymmetric stochastic shortest-path interdiction under conditional value-at-risk

Author

Listed:
  • Di H. Nguyen
  • J. Cole Smith

Abstract

We study a two-stage shortest-path interdiction problem between an interdictor and an evader, in which the cost for an evader to use each arc is given by the arc’s base cost plus an additional cost if the arc is attacked by the interdictor. The interdictor acts first to attack a subset of arcs, and then the evader traverses the network using a shortest path. In the problem we study, the interdictor does not know the exact value of each base cost, but instead only knows the (non-negative uniform) distribution of each arc’s base cost. The evader observes both the subset of arcs attacked by the interdictor and the true base cost values before traversing the network. The interdictor seeks to maximize the conditional value-at-risk of the evader’s shortest-path costs, given some specified risk parameter. We provide an exact method for this problem that utilizes row generation, partitioning, and bounding strategies, and demonstrate the efficacy of our approach on a set of randomly generated instances.

Suggested Citation

  • Di H. Nguyen & J. Cole Smith, 2024. "Asymmetric stochastic shortest-path interdiction under conditional value-at-risk," IISE Transactions, Taylor & Francis Journals, vol. 56(4), pages 398-410, April.
    • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:4:p:398-410
    DOI: 10.1080/24725854.2022.2043570
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2022.2043570
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/24725854.2022.2043570?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.

    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:56:y:2024:i:4:p:398-410. 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.