Abstract
We consider the problem of combining a given set of diagnostic tests into an inspection system to classify items of interest (cases) with maximum accuracy such that the cost of performing the tests does not exceed a given budget constraint. One motivating application is sequencing diagnostic tests for container inspection, where the diagnostic tests may correspond to radiation sensors, document checks, or imaging systems. We consider mixtures of decision trees as inspection systems following the work of Boros et al. (Nav. Res. Logist. 56:404–420, 2009). We establish some properties of efficient inspection systems and characterize the optimal classification of cases, based on some of their test scores. The measure of performance is the fraction of all cases in a specific class of interest, which are classified correctly. We propose a dynamic programming algorithm that constructs more complex policies by iteratively prefixing devices to a subset of policies and thereby enumerating all of the efficient (i.e., undominated) inspection policies in the two dimensional cost-detection space. Our inspection policies may sequence an arbitrary number of tests and are not restricted in the branching factor. Our approach directly solves the bi-criterion optimization problem of maximizing detection and minimizing cost, and thus supports sensitivity analysis over a wide range of budget and detection requirements.
Similar content being viewed by others
References
Avenhaus, R., Stengel, B. V., & Zamir, S. (1998). Inspection games. In R. J. Aumann & S. Hart (Eds.), Handbook of game theory, Vol. III.
Benson, H. P., & Lee, D. (1996). Outcome-based algorithm for optimizing over the efficient set of bicriteria linear programming problem. Journal of Optimization Theory and Applications, 88(1), 77–105.
Bier, V. M., & Haphuriwat, N. (2010, to appear). Analytical method to identify the number of containers to inspect at US ports to deter terrorist attack. Annals of Operations Research.
Boros, E., Fedzhora, L., Kantor, P. B., Saeger, K., & Stroud, P. (2009). Large scale LP model for finding optimal container inspection strategies. Naval Research Logistics, 56(5), 404–420.
Dantzig, G. (1957). Discrete-variable extremum problems. Operations Research, 5(2), 266–277.
Dyer, M. E. (1984). An O(n) algorithm for the multiple-choice knapsack linear program. Mathematical Programming, 29, 57–63.
Fawcett, T. (2006). An introduction to ROC analysis. Pattern Recognition Letters, 27(8), 861–874.
Frittelli, J. (2005). Port and maritime security: background and issues for congress. CRS Report RL31733, US Library of Congress.
Jacobson, S. H., Karnani, T., & Kobza, J. E. (2005). Assessing the impact of deterrence on aviation checked baggage screening strategies. International Journal of Risk Assessment and Management, 5(1), 1–15.
Glover, F., & Klingman, D. (1979). A O(nlog n) algorithm for LP knapsacks with GUB constraints. Mathematical Programming, 17, 345–361.
Ibaraki, T., Hasegawa, T., Teranaka, K., & Iwase, J. (1978). The multiple choice knapsack problem. Journal of the Operations Research Society of Japan, 21(1), 59–95.
Kantor, P.B., & Boros, E. (2010). Deceptive detection methods for optimal security with inadequate budgets: the Testing Power Index. Risk Analysis, 30(4), 663–673.
Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer.
Madigan, D., Mittal, S., & Roberts, F. (2007). Sequential decisions-making algorithms for port-of-entry inspection: Overcoming computational challenges. In Proceedings IEEE Intelligence and Security Informatics, New Brunswick, NJ (pp. 1–7).
Maschler, M. (1966). A price leadership method for solving the inspector’s non-constant-sum game. Naval Research Logistics Quarterly, 13, 11–33.
Pisinger, D. (1995). A minimal algorithm for the multiple-choice Knapsack problem. European Journal of Operations Research, 83, 394–410.
Ramirez-Marquez, J. (2008). Port-of-entry safety via the reliability optimization of container inspection strategy through an evolutionary approach. Reliability Engineering & System Safety, 93(11), 1698–1709.
Sinha, P., & Zoltners, A. A. (1979). The multiple-choice Knapsack problem. Operations Research, 27(3), 503–515.
Slaughter, D. R., Accatino, M. R., Bernstein, A., Biltoft, P., Church, J. A., Descalle, M. A., Hall, J. M., Manatt, D. R., Mauger, G. J., Moore, T. L., Norman, E. B., Petersen, D. C., Pruet, J. A., & Prussin, S. G. (2007). The nuclear car wash: A system to detect nuclear weapons in commercial cargo shipments. Nuclear Instruments and Methods in Physics Research Section A, 579(1), 349–352.
Stroud, P. D., & Saeger, K. J. (2003). Enumeration of increasing Boolean expressions and alternative digraph implementations for diagnostic applications. In H. Chu, J. Ferrer, T. Nguyen, & Y. Yu (Eds.), Proceedings of computer communication and control technologies, Vol. IV (pp. 328–333). Orlando: International Institute of Informatics and Systematics.
Zemel, E. (1980). The linear multiple choice Knapsack problem. Operations Research, 28(6), 1412–1423.
Zemel, E. (1984). An O(n) algorithm for the linear multiple choice knapsack problem and related problems. Information Processing Letters, 18, 123–128.
Author information
Authors and Affiliations
Corresponding author
Additional information
Funding by the Domestic Nuclear Detection Office (DNDO), of the Department of Homeland Security, through NSF Grants # CBET-0735910 and by Department of Homeland Security Grant/Contract #2008-DN-077-ARI003-0, the Science and Technology Directorate, Office of University Programs, by the National Science Foundation #SES 0518543 3/3 and by Office of Naval Research #DOD-DON-ONR-N00014-071-0150, # DOD-DON-ONR-N00014-07-1-0299 are all most gratefully acknowledged. The authors would like to thank DIMACS, and members of the DyDAn DHS Center of Excellence for stimulating discussions. We also thank Nir Halman and an anonymous referee for suggestions to improve the presentation.
Rights and permissions
About this article
Cite this article
Boros, E., Goldberg, N., Kantor, P.B. et al. Optimal sequential inspection policies. Ann Oper Res 187, 89–119 (2011). https://doi.org/10.1007/s10479-010-0799-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0799-6