抄録
This paper deals with the optimization of the airport check-in operation system, focusing on the security screening and recourse allocation. For higher security, fine inspection of check-in baggages should be carried out. Fine inspection, however, usually deteriorates the check-in efficiency. Under the constraints on the security index and the resources, which are respectively measured by the inspection failure rate and the number of check-in stuff members, we aim at minimizing the total delay time through the whole check-in process. We formulate this problem as a knapsack-type problem with two types of variables; the screening rate and the number of servers at each check-in counter. To solve the problem, a two-dimensional dynamic programming algorithm incorporating the Lagrangean relaxation technique is presented. Through numerical experiments on sample problems, the proposed approach is shown to be useful in conducting the airport operation in a secure and efficient manner.
