A new formulation and an effective matheuristic for the airport gate assignment problem

Karsu Ö., Solyalı O.

Computers and Operations Research, vol.151, 2023 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 151
  • Publication Date: 2023
  • Doi Number: 10.1016/j.cor.2022.106073
  • Journal Name: Computers and Operations Research
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus, PASCAL, ABI/INFORM, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Computer & Applied Sciences, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Keywords: Airport gate assignment problem, Mixed integer linear programming, Matheuristic, OPTIMIZATION, ALGORITHM, MODELS
  • Middle East Technical University Affiliated: Yes


© 2022 Elsevier LtdThis study considers an airport gate assignment problem where a set of aircraft arriving to an airport are assigned to the fixed gates of the airport terminal or to the apron. The aim is to lexicographically minimize the number of aircraft assigned to the apron, and then the total walking distance by passengers. A new mixed integer linear programming formulation and a matheuristic is proposed for the problem. The proposed formulation is based on the idea of flow of passengers and has smaller size compared to the existing formulations in the literature. The proposed matheuristic, which relies on solving a restricted version of the proposed formulation of the problem, is not only easy to implement but is also very effective. A computational study performed on benchmark instances reveals that the proposed formulation and the matheuristic outperform the existing exact and heuristic algorithms in the literature.