Robust flight-to-gate assignment using flight presence probabilities

Oscar R.P. van Schaijk, Hendrikus G. Visser

Research output: Contribution to journalArticleScientificpeer-review

11 Citations (Scopus)
45 Downloads (Pure)


In this paper we present a novel method to improve the robustness of solutions to the Flight-to-Gate Assignment Problem (FGAP), with the aim to reduce the need for gate re-planning due to unpredicted flight schedule disturbances in the daily operations at an airport. We propose an approach in which the deterministic gate constraints are replaced by stochastic gate constraints that incorporate the inherent stochastic flight delays in such a way so as to ensure that the expected gate conflict probability of two flights assigned to the same gate at the same time does not exceed a user-specified value. The novel approach is integrated into an existing multiple time slot FGAP model that relies on a binary integer programming formulation and is tested using real-life data pertaining to Amsterdam Airport Schiphol. The results confirm that the proposed approach holds out great promise to improve the robustness of the FGAP solutions.

Original languageEnglish
Pages (from-to)928-945
Number of pages18
JournalTransportation Planning and Technology
Issue number8
Publication statusPublished - 25 Jul 2017


  • Amsterdam Airport Schiphol
  • Gate assignment
  • gate conflict
  • mathematical programming
  • robustness
  • stochastic gate constraints

Fingerprint Dive into the research topics of 'Robust flight-to-gate assignment using flight presence probabilities'. Together they form a unique fingerprint.

Cite this