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.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.