Allocating explosive screening devices for aviation security

被引:0
|
作者
Sewell, Edward C. [1 ]
Attagara, Jackrapong [2 ]
Kobza, John E. [3 ]
Jacobson, Sheldon H. [4 ]
机构
[1] Southern Illinois Univ, Dept Math & Stat, Edwardsville, IL 62026 USA
[2] SCG Distribut Co Ltd, Bangkok 10800, Thailand
[3] Texas Tech Univ, Dept Ind Engn, Lubbock, TX 79409 USA
[4] Univ Illinois, Dept Comp Sci, Urbana, IL 61801 USA
基金
美国国家科学基金会;
关键词
Heuristics; Aviation security; Reliability problem; Nonlinear integer program;
D O I
10.1007/s12198-012-0087-6
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
This paper investigates the problem of allocating aviation security baggage screening devices across a set of airports. Prior to boarding an aircraft, passengers are divided into classes based on a passenger prescreening system that measures their perceived risk levels, which results in each passenger's baggage being screened by one or more security procedures. An explosive screening device allocation model is formulated to assign both the type of and number of devices to each class at each airport such that the total security is maximized subject to budget, resource, and throughput constraints. A Lagrangian relaxation is used to compute an upper bound for this objective function. Three heuristics, based on information from the Lagrangian relaxation, are proposed for addressing this model. Computational results are provided for several randomly generated problems, to provide insight into the effectiveness of the heuristics.
引用
收藏
页码:141 / 155
页数:15
相关论文
共 50 条