IDEAS home Printed from https://ideas.repec.org/a/eee/jaitra/v77y2019icp57-64.html
   My bibliography  Save this article

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

Author

Listed:
  • Ornek, M. Arslan
  • Ozturk, Cemalettin
  • Sugut, Ipek

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.

Suggested Citation

  • Ornek, M. Arslan & Ozturk, Cemalettin & Sugut, Ipek, 2019. "Model-based heuristic for counter assignment problem with operational constrains: A case study," Journal of Air Transport Management, Elsevier, vol. 77(C), pages 57-64.
  • Handle: RePEc:eee:jaitra:v:77:y:2019:i:c:p:57-64
    DOI: 10.1016/j.jairtraman.2019.03.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0969699718302898
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.jairtraman.2019.03.005?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yonghwa Park & Seung B. Ahn, 2003. "Optimal assignment for check-in counters based on passenger arrival behaviour at an airport," Transportation Planning and Technology, Taylor & Francis Journals, vol. 26(5), pages 397-416, October.
    2. van Dijk, Nico M. & van der Sluis, Erik, 2006. "Check-in computation and optimization by simulation and IP in combination," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1152-1168, June.
    3. Yan, Shangyao & Tang, Chin-Hui & Chen, Miawjane, 2004. "A model and a solution algorithm for airport common use check-in counter assignments," Transportation Research Part A: Policy and Practice, Elsevier, vol. 38(2), pages 101-125, February.
    4. Mahmut Parlar & Moosa Sharafali, 2008. "Dynamic Allocation of Airline Check-In Counters: A Queueing Optimization Approach," Management Science, INFORMS, vol. 54(8), pages 1410-1424, August.
    5. Ching-Hui Tang, 2010. "A network model for airport common use check-in counter assignments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1607-1618, November.
    6. Cynthia Barnhart & Peter Belobaba & Amedeo R. Odoni, 2003. "Applications of Operations Research in the Air Transport Industry," Transportation Science, INFORMS, vol. 37(4), pages 368-391, November.
    7. Yan, Shangyao & Chang, Kai-Cheng & Tang, Chin-Hui, 2005. "Minimizing inconsistencies in airport common-use checking counter assignments with a variable number of counters," Journal of Air Transport Management, Elsevier, vol. 11(2), pages 107-116.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. M. Arslan Ornek & Cemalettin Ozturk & Ipek Sugut, 2022. "Integer and constraint programming model formulations for flight-gate assignment problem," Operational Research, Springer, vol. 22(1), pages 135-163, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lalita, T.R. & Manna, D.K. & Murthy, G.S.R., 2020. "Mathematical formulations for large scale check-in counter allocation problem," Journal of Air Transport Management, Elsevier, vol. 85(C).
    2. Ying Liu & Xiuqing Yang & Yong Xiang & Yi Chen & Gang Mao & Xinzhi Zhou, 2022. "Allocation and optimization of shared self-service check-in system based on integer programming model," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 532-556, August.
    3. Mujica Mota, Miguel, 2015. "Check-in allocation improvements through the use of a simulation–optimization approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 77(C), pages 320-335.
    4. Mahmut Parlar & Moosa Sharafali, 2008. "Dynamic Allocation of Airline Check-In Counters: A Queueing Optimization Approach," Management Science, INFORMS, vol. 54(8), pages 1410-1424, August.
    5. Kuo, Chung-Wei & Jou, Rong-Chang, 2018. "Air passengers’ willingness to pay for counter check-in services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 107(C), pages 203-215.
    6. S Yan & C-H Tang & C-H Chen, 2008. "Reassignments of common-use check-in counters following airport incidents," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1100-1108, August.
    7. Ching-Hui Tang, 2010. "A network model for airport common use check-in counter assignments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1607-1618, November.
    8. Sultan Alodhaibi & Robert L. Burdett & Prasad K.D.V. Yarlagadda, 2020. "A Framework for Sharing Staff between Outbound and Inbound Airport Processes," Mathematics, MDPI, vol. 8(6), pages 1-18, June.
    9. João P. Pita & Cynthia Barnhart & António P. Antunes, 2013. "Integrated Flight Scheduling and Fleet Assignment Under Airport Congestion," Transportation Science, INFORMS, vol. 47(4), pages 477-492, November.
    10. Shone, Rob & Glazebrook, Kevin & Zografos, Konstantinos G., 2019. "Resource allocation in congested queueing systems with time-varying demand: An application to airport operations," European Journal of Operational Research, Elsevier, vol. 276(2), pages 566-581.
    11. Sciau, Jean-Baptiste & Goyon, Agathe & Sarazin, Alexandre & Bascans, Jérémy & Prud’homme, Charles & Lorca, Xavier, 2024. "Using constraint programming to address the operational aircraft line maintenance scheduling problem," Journal of Air Transport Management, Elsevier, vol. 115(C).
    12. Ilaria Vacca & Matteo Salani & Michel Bierlaire, 2013. "An Exact Algorithm for the Integrated Planning of Berth Allocation and Quay Crane Assignment," Transportation Science, INFORMS, vol. 47(2), pages 148-161, May.
    13. Haddad, M. & Sanders, D. & Tewkesbury, G., 2020. "Selecting a discrete multiple criteria decision making method for Boeing to rank four global market regions," Transportation Research Part A: Policy and Practice, Elsevier, vol. 134(C), pages 1-15.
    14. de Lange, Robert & Samoilovich, Ilya & van der Rhee, Bo, 2013. "Virtual queuing at airport security lanes," European Journal of Operational Research, Elsevier, vol. 225(1), pages 153-165.
    15. Sinclair, Karine & Cordeau, Jean-François & Laporte, Gilbert, 2014. "Improvements to a large neighborhood search heuristic for an integrated aircraft and passenger recovery problem," European Journal of Operational Research, Elsevier, vol. 233(1), pages 234-245.
    16. Li, Zhi-Chun & Lam, William H.K. & Wong, S.C. & Fu, Xiaowen, 2010. "Optimal route allocation in a liberalizing airline market," Transportation Research Part B: Methodological, Elsevier, vol. 44(7), pages 886-902, August.
    17. Bernardes Real, Luiza & O'Kelly, Morton & de Miranda, Gilberto & Saraiva de Camargo, Ricardo, 2018. "The gateway hub location problem," Journal of Air Transport Management, Elsevier, vol. 73(C), pages 95-112.
    18. Evelien van der Hurk & Leo Kroon & Gábor Maróti, 2018. "Passenger Advice and Rolling Stock Rescheduling Under Uncertainty for Disruption Management," Service Science, INFORMS, vol. 52(6), pages 1391-1411, December.
    19. Mohamed Haouari & Farah Zeghal Mansour & Hanif D. Sherali, 2019. "A New Compact Formulation for the Daily Crew Pairing Problem," Transportation Science, INFORMS, vol. 53(3), pages 811-828, May.
    20. Carlos Lagos & Felipe Delgado & Mathias A. Klapp, 2020. "Dynamic Optimization for Airline Maintenance Operations," Transportation Science, INFORMS, vol. 54(4), pages 998-1015, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jaitra:v:77:y:2019:i:c:p:57-64. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/journal-of-air-transport-management/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.