A large-scale linear programming model for finding optimal container inspection strategies

37Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

Abstract

Cargo ships arriving at US ports are inspected for unauthorized materials. Because opening and manually inspecting every container is costly and time-consuming, tests are applied to decide whether a container should be opened. By utilizing a polyhedral description of decision trees, we develop a large-scale linear programming model for sequential container inspection that determines an optimal inspection strategy under various limitations, improving on earlier approaches in several ways: (a) we consider mixed strategies and multiple thresholds for each sensor, which provide more effective inspection strategies; (b) our model can accommodate realistic limitations (budget, sensor capacity, time limits, etc.), as well as multiple container types; (c) our model is computationally more tractable allowing us to solve cases that were prohibitive in preceding models, and making it possible to analyze the potential impact of new sensor technologies. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 56: 404-420, 2009.

Cite

CITATION STYLE

APA

Boros, E., Fedzhora, L., Kantor, P. B., Saeger, K., & Stroud, P. (2009). A large-scale linear programming model for finding optimal container inspection strategies. Naval Research Logistics, 56(5), 404–420. https://doi.org/10.1002/nav.20349

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free