Model-based heuristic for counter assignment problem with operational constrains: A case study

ÖRNEK M. A., Ozturk C., Sugut I.

JOURNAL OF AIR TRANSPORT MANAGEMENT, cilt.77, ss.57-64, 2019 (SSCI, Scopus) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 77
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1016/j.jairtraman.2019.03.005
  • Dergi Adı: JOURNAL OF AIR TRANSPORT MANAGEMENT
  • Derginin Tarandığı İndeksler: Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.57-64
  • Orta Doğu Teknik Üniversitesi Kuzey Kıbrıs Kampüsü Adresli: Evet

Özet

Check-in counters have a great impact on the quality of service for airports. It is airport management's responsibility to provide check-in counters to airlines. Each check-in group (i.e., flights sharing the same resources) has a counter demand and this gives rise to a counter assignment problem. This is due to a number of objectives and constraints under which check-in groups are allocated to check-in counters. In this paper, we develop an Integer Programming model to optimally assign incoming flights to check-in counters and propose a decomposition algorithm to solve the allocation problem in a reasonable time. Computational results from a medium sized airport indicate a better utilisation of check-in counters, enabling airport management to reduce/postpone investment in additional check-in counters.