Integer programming models for deployment of airport baggage screening security devices

作     者：Jacobson, SH McLay, LA Virta, JL Kobza, JE 

作者机构：Univ Illinois Dept Mech & Ind Engn Simulat & Optimizat Lab Urbana IL 61801 USA Texas Tech Univ Dept Ind Engn Lubbock TX 79409 USA 

出 版 物：《OPTIMIZATION AND ENGINEERING》 (最优化与工程学)

年 卷 期：2005年第6卷第3期

页      面：339-359页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 0701[理学-数学] 

基　　金：National Science Foundation, NSF, (DMI-0114499, DMI-0114046, DMI-0114499) Air Force Office of Scientific Research, AFOSR, (FA9550-04-1-0110) 

主　　题：aviation security homeland security NP-completeness integer programming models cost analysis 

摘      要：Aviation security is an important problem of national interest and concern. Baggage screening security devices and operations at airports throughout the United States provide an important defense against terrorist actions targeted at commercial aircraft. Determining where to deploy such devices, and how to best use them can be quite challenging. This paper presents NP-complete decision problems concerning the deployment and utilization of baggage screening security devices. These problems incorporate three different deployment performance measures: uncovered baggage segments, uncovered flight segments, and uncovered passenger segments. Integer programming models are formulated to address optimization versions of these problems and to identify optimal baggage screening security device deployments (i.e., determine the number and type of baggage screening security devices that should be placed at different airports, and determining which baggage should be screened with such devices). The models are illustrated with an example that incorporates data extracted from the Official Airline Guide (OAG).