Optimizing the Airport Check-In Counter Allocation Problem

Abstract

Article Info AbstractKeywords: Airport Logistics Check-in Counter Allocation Problem Optimization Models Simulation This paper presents a new methodology to optimize the Airport Check-in Counter Allocation Problem. The methodology combines optimization, simulation and adjacent resource scheduling and aims to determine the optimal number, location and schedule of check-in desks to open for departing flights, such that operational costs are minimized and a given service level is ensured. The methodology is composed of three steps.Step 1 uses optimization models to determine the optimal number of desks.Step 2 uses simulation to assess if the first step results meet the overall service level.Step 3 uses an optimization model to enforce the adjacent constraint. The paper focus then onStep 1, to which we present two new optimization models for common and dedicated check-in systems which include a service level constraint. Finally, these models are applied to a case study with actual data. We conclude the best time interval length should be 30 minutes or less and, as expected, the dedicated system requires, in general, more desks than the common system. Additionally, the results demonstrate the accuracy of the models to reach the trade-off between the operational costs and a given service level.

Optimizing Airport Land Side Operations: Check-In, Passengers’ Migration, and Security Control Processes

“…Stochastic aspects are then modelled by simulation, and the effects of various parameters, such as number of passengers on a flight and Check-in counters opening and closing time, have been studied. In [12], authors minimize the operational costs, by proposing a methodology which combines optimization based on integer linear programming and simulation. e aim is to determine the optimal number, location, and schedule of Check-in counters to be opened for departing flights, such that a given service level is ensured.…”

A decision support system to improve performances of airport check-in services

“…They proposed a sequential stochastic assignment model to decide whether the n-th arriving passenger, requiring a certain type of check-in service, was to be assigned to a given facility or not, and then to determine the number of facilities of each type to be opened. Araujo and Repolho (2015) proposed a modification of the model by Bruno and Genovese (2010) to optimize the Airport Check-in Counter Allocation Problem (AC-CAP), introducing service level constraints. They also used a simulation approach to assess the results provided by the model.…”

“…If γ is equal to one, a maximum service level is guaranteed to passengers, as constraints impose to have no queue in each time period; by decreasing the value of such parameter, the feasible amount of passengers in queue in each time period may increase. Coherently to the approach suggested by Araujo and Repolho (2015), constraints (5) guarantee that the service time needed to accept passengers in each time period t (…”

Evolutionary dynamic optimisation of airport security lane schedules

“…The static policy only consists of a few decision variables and hence is an easy to optimise system. Araujo and Repolho [12] present a new methodology to optimise the check-in desk allocation problem maintaining a service level whilst reducing operational costs. Three phases are used whereby the first optimises the number of desks, the second uses simulation to test the service level and the third uses an optimisation model to solve an adjacent desk constraint.…”