Modeling and analyzing multiple station baggage screening security system performance
暂无分享,去创建一个
In the aftermath of the tragic events of 11 September 2001, numerous changes have been made to aviation security policy and operations throughout the nation's airports. The allocation and utilization of checked baggage screening devices is a critical component in aviation security systems. This paper formulates problems that model multiple sets of flights originating from multiple stations (e.g., airports, terminals), where the objective is to optimize a baggage screening performance measure subject to a finite amount of resources. These measures include uncovered flight segments (UFS) and uncovered passenger segments (UPS). Three types of multiple station security problems are identified and their computational complexity is established. The problems are illustrated on two examples that use data extracted from the Official Airline Guide. The examples indicate that the problems can provide widely varying solutions based on the type of performance measure used and the restrictions imposed by the security device allocations. Moreover, the examples suggest that the allocations based on the UFS measure also provide reasonable solutions with respect to the UPS measure; however, the reverse may not be the case. This suggests that the UFS measure may provide more robust screening device allocations. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.
[1] Sheldon Howard Jacobson,et al. Modeling aviation baggage screening security systems: a case study , 2003 .
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Petersen,et al. Introduction to the Sixth International Civil Aviation Security Conference (AVSEC'93) , 1994 .
[4] Paolo Toth,et al. Knapsack Problems: Algorithms and Computer Implementations , 1990 .
[5] Ronald L. Rivest,et al. Introduction to Algorithms , 1990 .