IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v168y2023icp1-26.html
   My bibliography  Save this article

A branch-and-price approach for airport gate assignment problem with chance constraints

Author

Listed:
  • Kim, Junyoung
  • Goo, Byungju
  • Roh, Youngjoo
  • Lee, Chungmok
  • Lee, Kyungsik

Abstract

At an airport, the flights should be attached to the gates to embark or disembark the passengers. The airport gate assignment problem concerns the efficient utilization of gates by assigning flights to the gates according to the flights’ planned schedules. However, due to ever-increasing air traffic demands and unpredictable weather conditions, it is hard to expect that the flights strictly follow the planned schedules. Therefore, establishing a robust gate assignment plan against uncertain flight schedule deviations is crucial for airport operators. However, ensuring the robustness of the plan by imposing too long idle times of gates may deteriorate the efficiency of gate usage. To address the trade-off between two goals, we introduce an overlap chance-constrained airport gate assignment problem that limits the probability of an overlap occurrence of flight schedules for each gate to given thresholds while maximizing the sum of preference values of flights for gates. We propose a network-based integer programming model for this problem, estimating the probability distribution using the historical flight arrival/departure deviation data. Then, we strengthen the model using the concept of gate assignment patterns, and a branch-and-price algorithm is devised to solve the model. A labeling algorithm-based efficient column generation algorithm is developed, further accelerated by clustering gates with similar characteristics. Through computational experiments, we demonstrate the efficiency of the proposed algorithm, and the trade-off between the overlap occurrence probability and the preference is analyzed using real-life instances.

Suggested Citation

  • Kim, Junyoung & Goo, Byungju & Roh, Youngjoo & Lee, Chungmok & Lee, Kyungsik, 2023. "A branch-and-price approach for airport gate assignment problem with chance constraints," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 1-26.
    • Handle: RePEc:eee:transb:v:168:y:2023:i:c:p:1-26
    DOI: 10.1016/j.trb.2022.12.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261522002077
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2022.12.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. Daş, Gülesin Sena & Gzara, Fatma & Stützle, Thomas, 2020. "A review on airport gate assignment problems: Single versus multi objective approaches," Omega, Elsevier, vol. 92(C).
    2. Yan, Shangyao & Shieh, Chi-Yuan & Chen, Miawjane, 2002. "A simulation framework for evaluating airport gate assignments," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(10), pages 885-898, December.
    3. Martin Savelsbergh, 1997. "A Branch-and-Price Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 45(6), pages 831-841, December.
    4. Cynthia Barnhart & Ellis L. Johnson & George L. Nemhauser & Martin W. P. Savelsbergh & Pamela H. Vance, 1998. "Branch-and-Price: Column Generation for Solving Huge Integer Programs," Operations Research, INFORMS, vol. 46(3), pages 316-329, June.
    5. Pternea, Moschoula & Haghani, Ali, 2019. "An aircraft-to-gate reassignment framework for dealing with schedule disruptions," Journal of Air Transport Management, Elsevier, vol. 78(C), pages 116-132.
    6. R. S. Mangoubi & Dennis F. X. Mathaisel, 1985. "Optimizing Gate Assignments at Airport Terminals," Transportation Science, INFORMS, vol. 19(2), pages 173-188, May.
    7. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    8. Du, Jia Yan & Brunner, Jens O. & Kolisch, Rainer, 2014. "Planning towing processes at airports more efficiently," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 293-304.
    9. Cynthia Barnhart & Christopher A. Hane & Pamela H. Vance, 2000. "Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems," Operations Research, INFORMS, vol. 48(2), pages 318-326, April.
    10. C Lee & K Lee & S Park, 2012. "Robust vehicle routing problem with deadlines and travel time/demand uncertainty," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(9), pages 1294-1306, September.
    11. Guépet, J. & Acuna-Agost, R. & Briant, O. & Gayon, J.P., 2015. "Exact and heuristic approaches to the airport stand allocation problem," European Journal of Operational Research, Elsevier, vol. 246(2), pages 597-608.
    12. Xu, Liang & Zhang, Chao & Xiao, Feng & Wang, Fan, 2017. "A robust approach to airport gate assignment with a solution-dependent uncertainty budget," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 458-478.
    13. Şeker, Merve & Noyan, Nilay, 2012. "Stochastic optimization models for the airport gate assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 438-459.
    14. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.
    15. Yin, Suwan & Han, Ke & Ochieng, Washington Yotto & Sanchez, Daniel Regueiro, 2022. "Joint apron-runway assignment for airport surface operations," Transportation Research Part B: Methodological, Elsevier, vol. 156(C), pages 76-100.
    Full references (including those not matched with items on IDEAS)

    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. Bert Dijk & Bruno F. Santos & Joao P. Pita, 2019. "The recoverable robust stand allocation problem: a GRU airport case study," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(3), pages 615-639, September.
    2. Yin, Suwan & Han, Ke & Ochieng, Washington Yotto & Sanchez, Daniel Regueiro, 2022. "Joint apron-runway assignment for airport surface operations," Transportation Research Part B: Methodological, Elsevier, vol. 156(C), pages 76-100.
    3. Xu, Liang & Zhang, Chao & Xiao, Feng & Wang, Fan, 2017. "A robust approach to airport gate assignment with a solution-dependent uncertainty budget," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 458-478.
    4. Li, Mingjie & Hao, Jin-Kao & Wu, Qinghua, 2022. "Learning-driven feasible and infeasible tabu search for airport gate assignment," European Journal of Operational Research, Elsevier, vol. 302(1), pages 172-186.
    5. Skorupski, Jacek & Żarów, Piotr, 2021. "Dynamic management of aircraft stand allocation," Journal of Air Transport Management, Elsevier, vol. 90(C).
    6. Zhang, Dong & Klabjan, Diego, 2017. "Optimization for gate re-assignment," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 260-284.
    7. Bagamanova, Margarita & Mota, Miguel Mujica, 2020. "A multi-objective optimization with a delay-aware component for airport stand allocation," Journal of Air Transport Management, Elsevier, vol. 83(C).
    8. Karsu, Özlem & Azizoğlu, Meral & Alanlı, Kerem, 2021. "Exact and heuristic solution approaches for the airport gate assignment problem," Omega, Elsevier, vol. 103(C).
    9. Amy Cohn & Michael Magazine & George Polak, 2009. "Rank‐Cluster‐and‐Prune: An algorithm for generating clusters in complex set partitioning problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(3), pages 215-225, April.
    10. Zhang, Guowei & Jia, Ning & Zhu, Ning & Adulyasak, Yossiri & Ma, Shoufeng, 2023. "Robust drone selective routing in humanitarian transportation network assessment," European Journal of Operational Research, Elsevier, vol. 305(1), pages 400-428.
    11. Seohee Kim & Chungmok Lee, 2021. "A branch and price approach for the robust bandwidth packing problem with queuing delays," Annals of Operations Research, Springer, vol. 307(1), pages 251-275, December.
    12. Jans, Raf, 2010. "Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems," European Journal of Operational Research, Elsevier, vol. 204(2), pages 251-254, July.
    13. David R. Morrison & Edward C. Sewell & Sheldon H. Jacobson, 2016. "Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 67-82, February.
    14. de Matta, Renato & Peters, Emmanuel, 2009. "Developing work schedules for an inter-city transit system with multiple driver types and fleet types," European Journal of Operational Research, Elsevier, vol. 192(3), pages 852-865, February.
    15. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    16. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    17. Degraeve, Z. & Jans, R.F., 2003. "A New Dantzig-Wolfe Reformulation And Branch-And-Price Algorithm For The Capacitated Lot Sizing Problem With Set Up Times," ERIM Report Series Research in Management ERS-2003-010-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    18. Daş, Gülesin Sena & Gzara, Fatma & Stützle, Thomas, 2020. "A review on airport gate assignment problems: Single versus multi objective approaches," Omega, Elsevier, vol. 92(C).
    19. Gamvros, Ioannis & Raghavan, S., 2012. "Multi-period traffic routing in satellite networks," European Journal of Operational Research, Elsevier, vol. 219(3), pages 738-750.
    20. Hagspihl, Thomas & Kolisch, Rainer & Ruf, Christian & Schiffels, Sebastian, 2022. "Dynamic gate configurations at airports: A network optimization approach," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1133-1148.

    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:transb:v:168:y:2023:i:c:p:1-26. 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.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.