Exact and heuristic solution approaches for the airport gate assignment problem
Date
2021-01-30Source Title
Omega
Print ISSN
0305-0483
Electronic ISSN
1873-5274
Publisher
Elsevier
Volume
103
Pages
1 - 15
Language
English
Type
ArticleItem Usage Stats
16
views
views
0
downloads
downloads
Abstract
In 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.
Keywords
Airport gate assignment problemMixed integer linear programming
Branch-and-bound algorithm
Beam search algorithm
Filtered beam search algorithm