Premium
Simulation optimization in security screening systems subject to budget and waiting time constraints
Author(s) -
Tsai Shing Chih,
Chen Huifen,
Wang Honggang,
Zhang Zhe George
Publication year - 2021
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.21976
Subject(s) - bounding overwatch , computer science , mathematical optimization , convergence (economics) , nexus (standard) , process (computing) , markov process , operations research , budget constraint , mathematics , artificial intelligence , statistics , neoclassical economics , economics , embedded system , economic growth , operating system
Motivated by the NEXUS program between the US‐Canada border, we consider a security screening process where travelers such as cars and trucks are assigned to a selectee or nonselectee lane depending on whether their threat values exceed a threshold level. The goal is to design a two‐tier system to maximize the probability of detecting a threat subject to the waiting time and operating cost constraints. We formulate the problem as an optimization program, in which the objective function and some variables can be estimated only by simulation. We then develop algorithms to compute the global optimum, within a proposed bounding region, for the Markovian and non‐Markovian systems, respectively. The convergence analysis and extensive numerical results are provided to demonstrate the algorithms' promising performance.