期刊
OPTIMIZATION LETTERS
卷 9, 期 8, 页码 1477-1494出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-014-0829-4
关键词
Tabu search; Prioritization; Stochastic integer program; Network interdiction
资金
- DTRA [HDTRA1-08-1-0029]
- US DHS [2008-DN-077-ARI021-05]
We describe an optimization model for interdicting smuggling of illicit nuclear material. Modeled on a directed network, the interdictor's goal is to select radiation detector installation locations, subject to a budget constraint, to minimize a smuggler's evasion probability. A smuggler, characterized by a random origin-destination pair, traverses the network knowing the detector locations. An additional layer of uncertainty is captured when considering a set of budget scenarios in place of a fixed budget value. An optimal solution to this model yields a priority list of detector installation locations. After the budget is revealed, detectors are installed from highest to lowest priority until the budget is exhausted. This notion captures time-phased securing of a transportation network as resources become available. Modeled as bilevel stochastic mixed-integer programs, both the fixed and random budget models are computationally challenging. Hence, we develop a tabu search heuristic to approximately solve both problem types, and we present computational results to assess the performance of our algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据