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

M. Arslan Ornek, Cemalettin Ozturk and Ipek Sugut

Journal of Air Transport Management, 2019, vol. 77, issue C, 57-64

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.

Keywords: Counter assignment; Integer programming; Heuristics; Airport management (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0969699718302898
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jaitra:v:77:y:2019:i:c:p:57-64

DOI: 10.1016/j.jairtraman.2019.03.005

Access Statistics for this article

Journal of Air Transport Management is currently edited by Anne Graham

More articles in Journal of Air Transport Management from Elsevier
Bibliographic data for series maintained by Catherine Liu ().