A Branch-and-Bound Algorithm for Airport Gate Assignment Problem

---

Tezin Türü: Yüksek Lisans

Tezin Yürütüldüğü Kurum: Orta Doğu Teknik Üniversitesi, Fen Bilimleri Enstitüsü, Türkiye

Tezin Onay Tarihi: 2019

Tezin Dili: İngilizce

Öğrenci: KEREM ALANLI

Asıl Danışman (Eş Danışmanlı Tezler İçin): Meral Azizoğlu

Özet:

In this study, we consider an airport gate assignment problem that assigns a number of aircraft to a set of gates so as to minimize total walking distance travelled by all passengers. The aircraft that cannot be assigned to any gate due to overlaps are directed to an apron. The problem is formulated as a mixed-integer nonlinear programming model and then it is linearized. A branch-and-bound algorithm that employs powerful bounding mechanisms is developed. The results of the computational experiment have shown that the mathematical model can handle small sized problem instances, while the branch-and-bound solves relatively larger instances in reasonable time.