 Exact and heuristic solution approaches for the airport gate assignment problemÖzlem Karsu, Meral Azizoğlu and Kerem Alanlı Omega, 2021, vol. 103, issue C 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 problem; Mixed integer linear programming; Branch-and-bound algorithm; Beam search algorithm; Filtered beam search algorithm (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:eee:jomega:v:103:y:2021:i:c:s0305048321000311 Ordering information: This journal article can be ordered from DOI: 10.1016/j.omega.2021.102422 Access Statistics for this article Omega is currently edited by B. Lev More articles in Omega from Elsevier |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.