.png){kind=icon}
.png){kind=icon}
Return
Model-based heuristic for counter assignment problem with operational constrains: A case study
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jairtraman.2019.03.005.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
2.4K
Citations:
5.6K
Organization
View more organizations