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

Apron layout planning–Optimal positioning of aircraft stands

Author

Listed:
  • Hagspihl, Thomas
  • Kolisch, Rainer
  • Fontaine, Pirmin
  • Schiffels, Sebastian

Abstract

At many airports, space on the apron is scarce and has to be used efficiently. To that end, we optimize the layout of aircraft parking positions adjacent to the airport terminal, pursuing two lexicographically ordered objectives. First, we minimize the number of aircraft that have to be diverted to remote parking positions, because positions adjacent to the terminal are not available. Second, we minimize the construction effort required for gate infrastructure. Aircraft collisions must be prevented at all times, and we consider various traffic situations, as traffic volume and fleet mix are not constant in time. We introduce the Airport Gate Layout Problem and formulate it as a mixed-integer model, which considers both greenfield and brownfield scenarios. To solve the problem efficiently, we introduce a decomposition framework that exploits the structure of the problem and employ various acceleration techniques. Our approach reduces computation times substantially, allowing us to solve instances that are intractable for CPLEX. Based on a case study for Munich Airport, we demonstrate how airports can gain valuable insights from solving the problem.

Suggested Citation

  • Hagspihl, Thomas & Kolisch, Rainer & Fontaine, Pirmin & Schiffels, Sebastian, 2024. "Apron layout planning–Optimal positioning of aircraft stands," Transportation Research Part B: Methodological, Elsevier, vol. 179(C).
    • Handle: RePEc:eee:transb:v:179:y:2024:i:c:s0191261523001790
    DOI: 10.1016/j.trb.2023.102854
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261523001790
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2023.102854?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. Umetani, Shunji & Murakami, Shohei, 2022. "Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1009-1026.
    2. Briskorn, Dirk & Dienstknecht, Michael, 2019. "Mixed-integer programming models for tower crane selection and positioning with respect to mutual interference," European Journal of Operational Research, Elsevier, vol. 273(1), pages 160-174.
    3. 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).
    4. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    5. Stephan, Konrad & Weidinger, Felix & Boysen, Nils, 2021. "Layout Design of Parking Lots with Mathematical Programming," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 127596, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    6. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
    7. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2007. "Flight gate scheduling: State-of-the-art and recent developments," Omega, Elsevier, vol. 35(3), pages 326-334, June.
    8. Stephan, Konrad & Weidinger, Felix & Boysen, Nils, 2021. "Layout Design of Parking Lots with Mathematical Programming," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 128587, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    9. Wirasinghe, S. C. & Bandara, S., 1990. "Airport gate position estimation for minimum total costs--Approximate closed form solution," Transportation Research Part B: Methodological, Elsevier, vol. 24(4), pages 287-297, August.
    10. Narciso, Mercedes E. & Piera, Miquel A., 2015. "Robust gate assignment procedures from an airport management perspective," Omega, Elsevier, vol. 50(C), pages 82-95.
    11. Alvarez-Valdes, R. & Martinez, A. & Tamarit, J.M., 2013. "A branch & bound algorithm for cutting and packing irregularly shaped pieces," International Journal of Production Economics, Elsevier, vol. 145(2), pages 463-477.
    12. 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.
    13. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2012. "Flight gate scheduling with respect to a reference schedule," Annals of Operations Research, Springer, vol. 194(1), pages 177-187, April.
    14. Martinez-Sykora, A. & Alvarez-Valdes, R. & Bennell, J.A. & Ruiz, R. & Tamarit, J.M., 2017. "Matheuristics for the irregular bin packing problem with free rotations," European Journal of Operational Research, Elsevier, vol. 258(2), pages 440-455.
    15. Chehrazad, Sahar & Roose, Dirk & Wauters, Tony, 2022. "A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation," European Journal of Operational Research, Elsevier, vol. 300(3), pages 809-826.
    16. J A Bennell & J F Oliveira, 2009. "A tutorial in irregular shape packing problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 93-105, May.
    17. Tung Tung, Chi & Lin Chew, Kim, 1992. "A multicriteria Pareto-optimal path algorithm," European Journal of Operational Research, Elsevier, vol. 62(2), pages 203-209, October.
    18. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2008. "Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem," Transportation Science, INFORMS, vol. 42(3), pages 292-301, August.
    19. Caves, Robert, 1994. "A search for more airport apron capacity," Journal of Air Transport Management, Elsevier, vol. 1(2), pages 109-120.
    20. Bennell, Julia A. & Oliveira, Jose F., 2008. "The geometry of nesting problems: A tutorial," European Journal of Operational Research, Elsevier, vol. 184(2), pages 397-415, January.
    21. 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.
    22. Gerald N. Steuart, 1974. "Gate Position Requirements at Metropolitan Airports," Transportation Science, INFORMS, vol. 8(2), pages 169-189, May.
    23. 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.
    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. 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.
    2. 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.
    3. Zhang, Dong & Klabjan, Diego, 2017. "Optimization for gate re-assignment," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 260-284.
    4. 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.
    5. 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.
    6. Zhao, Peixin & Han, Xue & Wan, Di, 2021. "Evaluation of the airport ferry vehicle scheduling based on network maximum flow model," Omega, Elsevier, vol. 99(C).
    7. Leao, Aline A.S. & Toledo, Franklina M.B. & Oliveira, José Fernando & Carravilla, Maria Antónia & Alvarez-Valdés, Ramón, 2020. "Irregular packing problems: A review of mathematical models," European Journal of Operational Research, Elsevier, vol. 282(3), pages 803-822.
    8. 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.
    9. Kimms, Alf & Király, Hédi, 2023. "An extended model formulation for the two-dimensional irregular strip packing problem considering general industry-relevant aspects," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1202-1218.
    10. Lastra-Díaz, Juan J. & Ortuño, M. Teresa, 2024. "Mixed-integer programming models for irregular strip packing based on vertical slices and feasibility cuts," European Journal of Operational Research, Elsevier, vol. 313(1), pages 69-91.
    11. 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).
    12. Karsu, Özlem & Azizoğlu, Meral & Alanlı, Kerem, 2021. "Exact and heuristic solution approaches for the airport gate assignment problem," Omega, Elsevier, vol. 103(C).
    13. 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.
    14. Germán Pantoja-Benavides & David Álvarez-Martínez & Francisco Parreño Torres, 2024. "The Normalized Direct Trigonometry Model for the Two-Dimensional Irregular Strip Packing Problem," Mathematics, MDPI, vol. 12(15), pages 1-25, August.
    15. Hutter, Leonie & Jaehn, Florian & Neumann, Simone, 2019. "Influencing factors on airplane boarding times," Omega, Elsevier, vol. 87(C), pages 177-190.
    16. Skorupski, Jacek & Żarów, Piotr, 2021. "Dynamic management of aircraft stand allocation," Journal of Air Transport Management, Elsevier, vol. 90(C).
    17. Wang, Li & Tang, Yuxiang & Zhang, Gaotian & Kang, Wenxuan & Zhuang, Yufeng & Su, Zhiyuan, 2024. "Research on airport apron planning strategy in emergency situations," Journal of Air Transport Management, Elsevier, vol. 117(C).
    18. 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.
    19. Yainier Labrada-Nueva & Martin H. Cruz-Rosales & Juan Manuel Rendón-Mancha & Rafael Rivera-López & Marta Lilia Eraña-Díaz & Marco Antonio Cruz-Chávez, 2021. "Overlap Detection in 2D Amorphous Shapes for Paper Optimization in Digital Printing Presses," Mathematics, MDPI, vol. 9(9), pages 1-22, May.
    20. Jäck, Christian & Gönsch, Jochen, 2024. "How to load your auto carrier. A hybrid packing approach for the auto-carrier loading problem," European Journal of Operational Research, Elsevier, vol. 315(3), pages 1167-1181.

    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:179:y:2024:i:c:s0191261523001790. 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.