Robust Flight-to-Gate Assignment Planning with Airside and Landside Constraints

Abstract

The Flight-to-Gate Assignment Problem (FGAP) covers the optimal assignment of flights, or rather the aircraft serving these flights, to the available aircraft stands. Existing FGAP models in literature do not consider airside and landside processes simultaneously. We propose a FGAP model with three specifications, where only airside constraints are active, both airside and landside constraint are active and passenger demand cannot exceed the fixed declared landside capacity, and both airside and landside constraint are active, and the landside passenger constraints are driven by the expected maximum passenger waiting time. The implementation of landside constraints results in a gate assignment at a increased cost, compared to gate assignment derived using inactive landside constraints. Imposing the constraint that passenger demand cannot exceed declared capacity creates a gate assignment at an increased cost com- pared to implementing a maximum passenger waiting time, but does o↵er a superior passenger experience since waiting times are non-existent.