Exact and heuristic solution approaches for the airport gate assignment problem


Karsu Ö., AZİZOĞLU M. , Alanlı K.

Omega (United Kingdom), vol.103, 2021 (Journal Indexed in SCI) identifier identifier

  • Publication Type: Article / Article
  • Volume: 103
  • Publication Date: 2021
  • Doi Number: 10.1016/j.omega.2021.102422
  • Title of Journal : Omega (United Kingdom)
  • Keywords: Airport gate assignment problem, Mixed integer linear programming, Branch-and-bound algorithm, Beam search algorithm, Filtered beam search algorithm, EXPERT-SYSTEM, OPTIMIZATION

Abstract

© 2021 Elsevier LtdIn this study, we consider an airport gate assignment problem that assigns a set of aircraft to a set of gates. The aircraft that cannot be assigned to any gate are directed to an apron. We aim to make aircraft-gate assignments so as to minimize the number of aircraft assigned to apron and among the apron usage minimizing solutions, we aim to minimize total walking distance travelled by all passengers. The problem is formulated as a mixed-integer nonlinear programming model and then it is linearized. A branch and bound algorithm, beam search and filtered beam search algorithms that employ powerful lower and upper bounding mechanisms are developed. The results of the computational experiment have shown the satisfactory performance of the algorithms.