IDEAS home Printed from https://ideas.repec.org/a/kap/netspa/v25y2025i1d10.1007_s11067-024-09649-9.html
   My bibliography  Save this article

Optimal Aircraft Stands Assignment for Close Proximity Parking Demands

Author

Listed:
  • Chun-Ying Chen

    (Tamkang University)

  • Shu-Rong Jiang

    (Tamkang University)

Abstract

Major events like COVID-19 can lead to a sudden decline in passenger demand for airlines globally, resulting in the grounding of aircraft by carriers worldwide. To ensure ample parking space, carriers have implemented a close proximity parking strategy for aircraft, ensuring efficient use of available space. When multiple aircraft can park in a single space, inadequate planning may lead to various blockages. This not only raises airline costs but also reduces the operational efficiency of the airport. At present, the problem of assigning airplanes to airplanes in such a close proximity parking situation is planned manually, which is inefficient and may not be the optimal solution for the system. In this study, we employed time-space network flow techniques and mathematical programming to develop an optimal stand assignment model from the perspective of a planner. Then, based on the real flight data of Taoyuan International Airport, we conducted a case study and different scenarios. The results show that the proposed model is an effective auxiliary tool to assist the planners in optimizing the aircraft stand assignments under a close proximity parking strategy.

Suggested Citation

  • Chun-Ying Chen & Shu-Rong Jiang, 2025. "Optimal Aircraft Stands Assignment for Close Proximity Parking Demands," Networks and Spatial Economics, Springer, vol. 25(1), pages 43-65, March.
    • Handle: RePEc:kap:netspa:v:25:y:2025:i:1:d:10.1007_s11067-024-09649-9
    DOI: 10.1007/s11067-024-09649-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11067-024-09649-9
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11067-024-09649-9?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:kap:netspa:v:25:y:2025:i:1:d:10.1007_s11067-024-09649-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.