Efficient sequential decision‐making algorithms for container inspection operations |
| |
Authors: | David Madigan Sushil Mittal Fred Roberts |
| |
Affiliation: | 1. Department of Statistics Columbia University, New York;2. Department of Electrical and Computer Engineering Rutgers, The state university of New Jersey;3. DIMACS Rutgers, The State university of New Jersey |
| |
Abstract: | Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees that are more efficient computationally than those presented by Stroud and Saeger and Anand et al. We achieve these efficiencies through a combination of specific numerical methods for finding optimal thresholds for sensor functions and two novel binary decision tree search algorithms that operate on a space of potentially acceptable binary decision trees. The improvements enable us to analyze substantially larger applications than was previously possible. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 |
| |
Keywords: | sequential decision making Boolean function binary decision tree container inspection heuristic algorithms |
|
|