10:30 AM - 10:55 AM
Risk-Based Policies for Airport Security Checkpoint Screening
This paper identifies a methodology that can be used to sequentially and optimally assign passengers to aviation security resources. The objective is to use the passengers’ perceived risk levels to determine the optimal policy for passenger screening assignments that maximize the expected total security, subject to capacity and assignment constraints. The sequential passenger assignment problem is formulated as a Markov decision process and an optimal policy is found using dynamic programming. The general result from the sequential stochastic assignment problem is adapted to provide a heuristic for assigning passengers to security classes in real time. A condition is provided under which this heuristic yields the optimal policy.
10:55 AM - 11:20 AM
The Ground Crew Rostering Problem with Work Patterns for a major European Airline
Ground crew rostering is an important manpower planning problem in airline companies. We present an integrated model for roster construction based directly on estimated workload demands - robustness is easily incorporated. Solutions are efficiently obtained using a powerful variable fixing and column generation approach. Methodology and results are reported.
11:20 AM - 11:45 AM
Hybrid Model of Demand Prediction in a Transportation System
We consider the forecasting of demand in transportation. The historical data is constrained because of the seat limitations; therefore, we only observe the registered bookings. It is preferable to “uncensor” the observations for representing the true demand. We propose a new approach to tackle this problem which results in improving demand forecasting.
11:45 AM - 12:10 PM
The Counter Check-In allocation problem at Copenhagen Airport
Allocating counters for check-in is a central task for airport authorities. With the increasing number of airline travellers and the subsequent increased demand of check-in counters efficient planning is crucial. Based on the estimated data the problem of generating a daily counter allocation can be modelled as a Mixed Integer Linear programme. The problem is closely connected to the NP-hard Adjacent Resource Allocation problem. Our formulation seeks to spread out queuing, baggage in-take and usage of CUSS (Common Use Self check-in) as much as possible throughout the airport.