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

Di H. Nguyen and J. Cole Smith

IISE Transactions, 2024, vol. 56, issue 4, 398-410

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.

Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://hdl.handle.net/10.1080/24725854.2022.2043570 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:taf:uiiexx:v:56:y:2024:i:4:p:398-410

Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/uiie20

DOI: 10.1080/24725854.2022.2043570

Access Statistics for this article

IISE Transactions is currently edited by Jianjun Shi

More articles in IISE Transactions from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().