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

ÖRNEK, MUSTAFA; Ozturk, Cemalettin; Sugut, Ipek

doi:10.1016/j.jairtraman.2019.03.005

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, vol.77, pp.57-64, 2019 (SSCI, Scopus)

Publication Type: Article / Article
Volume: 77
Publication Date: 2019
Doi Number: 10.1016/j.jairtraman.2019.03.005
Journal Name: JOURNAL OF AIR TRANSPORT MANAGEMENT
Journal Indexes: Social Sciences Citation Index (SSCI), Scopus
Page Numbers: pp.57-64
Middle East Technical University Northern Cyprus Campus Affiliated: Yes

Abstract

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.