## Abstract

We describe two stochastic network interdiction models for thwarting nuclear smuggling. In the first model, the smuggler travels through a transportation network on a path that maximizes the probability of evading detection, and the interdictor installs radiation sensors to minimize that evasion probability. The problem is stochastic because the smuggler's origin-destination pair is known only through a probability distribution at the time when the sensors are installed. In this model, the smuggler knows the locations of all sensors and the interdictor and the smuggler "agree" on key network parameters, namely the probabilities the smuggler will be detected while traversing the arcs of the transportation network. Our second model differs in that the interdictor and smuggler can have differing perceptions of these network parameters. This model captures the case in which the smuggler is aware of only a subset of the sensor locations. For both models, we develop the important special case in which the sensors can only be installed at border crossings of a single country so that the resulting model is defined on a bipartite network. In this special case, a class of valid inequalities reduces the computation time for the identical-perceptions model.

Original language | English (US) |
---|---|

Pages (from-to) | 3-14 |

Number of pages | 12 |

Journal | IIE Transactions (Institute of Industrial Engineers) |

Volume | 39 |

Issue number | 1 |

DOIs | |

State | Published - Jan 2007 |

## Keywords

- Integer programming
- Network interdiction
- Stochastic programming

## ASJC Scopus subject areas

- Industrial and Manufacturing Engineering