Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 141-155 |
Number of pages | 15 |
Journal | Journal of Transportation Security |
Volume | 5 |
Issue number | 2 |
DOIs | |
State | Published - Jun 2012 |
Keywords
- Aviation security
- Heuristics
- Nonlinear integer program
- Reliability problem
ASJC Scopus subject areas
- Transportation
- Sociology and Political Science
- Safety Research
- Political Science and International Relations
- Management Science and Operations Research
- Law