TY - JOUR
T1 - Optimal aviation security screening strategies with dynamic passenger risk updates
AU - Nikolaev, Alexander G.
AU - Lee, Adrian J.
AU - Jacobson, Sheldon H.
N1 - Funding Information:
Manuscript received March 6, 2011; revised July 20, 2011; accepted August 27, 2011. Date of publication September 23, 2011; date of current version March 5, 2012. This work was supported in part by the National Science Foundation under Grant DMI-0114499 and in part by the Air Force Office of Scientific Research under Grant FA9550-10-1-0387. The views expressed in this paper are those of the authors and do not reflect the official policy or position of the United States Air Force, Department of Defense, National Science Foundation, or the United States Government. The Associate Editor for this paper was J.-P. B. Clarke.
PY - 2012/3
Y1 - 2012/3
N2 - Passenger screening is a critical component of aviation security systems. This paper introduces the multistage sequential passenger screening problem (MSPSP), which models passenger and carry-on baggage screening operations in an aviation security system with the capability of dynamically updating the perceived risk of passengers. The passenger screening operation at an airport terminal is subdivided into multiple screening stages, with decisions made to assign each passenger to one of several available security classes at each such stage. Each passenger's assessed threat value (initially determined by an automated passenger prescreening system) is updated after the passenger proceeds through each screening stage. The objective of MSPSP is to maximize the total security of all passenger screening decisions over a fixed time period, given passenger perceived risk levels and security device performance parameters. An optimal policy for screening passengers in MSPSP is obtained using optimal sequential assignment theory. A Monte Carlo simulation-based heuristic is presented and compared with stochastic sequential assignment and feedback control algorithms. Computational analysis of a two-stage security system provides an assessment of the total security performance.
AB - Passenger screening is a critical component of aviation security systems. This paper introduces the multistage sequential passenger screening problem (MSPSP), which models passenger and carry-on baggage screening operations in an aviation security system with the capability of dynamically updating the perceived risk of passengers. The passenger screening operation at an airport terminal is subdivided into multiple screening stages, with decisions made to assign each passenger to one of several available security classes at each such stage. Each passenger's assessed threat value (initially determined by an automated passenger prescreening system) is updated after the passenger proceeds through each screening stage. The objective of MSPSP is to maximize the total security of all passenger screening decisions over a fixed time period, given passenger perceived risk levels and security device performance parameters. An optimal policy for screening passengers in MSPSP is obtained using optimal sequential assignment theory. A Monte Carlo simulation-based heuristic is presented and compared with stochastic sequential assignment and feedback control algorithms. Computational analysis of a two-stage security system provides an assessment of the total security performance.
KW - Aviation security
KW - Monte Carlo simulation
KW - optimal sequential assignment
KW - policy modeling
UR - http://www.scopus.com/inward/record.url?scp=84857790721&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84857790721&partnerID=8YFLogxK
U2 - 10.1109/TITS.2011.2167230
DO - 10.1109/TITS.2011.2167230
M3 - Article
AN - SCOPUS:84857790721
SN - 1524-9050
VL - 13
SP - 203
EP - 212
JO - IEEE Transactions on Intelligent Transportation Systems
JF - IEEE Transactions on Intelligent Transportation Systems
IS - 1
M1 - 6029453
ER -