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

Optimal clustering analysis for airport parking

Author

Listed:
  • Chen, Cheng-Chieh (Frank)
  • Schonfeld, Paul

Abstract

Air travelers are often hurried and at risk of missing their flights. Many of them are quite sensitive to service quality and overall travel times. In larger airports the demand for parking spaces forces many users to park quite far from passenger terminals. Thus, it is desirable to allocate available parking spaces at any given time in ways that minimize the users' access distances. Although the major layout and allocation decisions for airport parking are highly constrained by available land and physical parking infrastructure, a well-designed parking clustering scheme based on expected parking durations could assist airport operators in effectively allocating limited space, which minimizes the travelers' average access distances between parking facilities and an airport terminal by employing grouping concepts based on the expected parking time durations of vehicles. In subdividing the available parking facilities, the boundaries between different user groups (e.g., short, medium, and long term) are optimized based on the distributions of (1) expected vehicle dwell times and (2) available parking capacity at various access distances from airport terminals. Even with only two clusters (e.g., short-term and long-term parking), results show that average access distances from parking spaces to terminals can be reduced by 25–44%. Although additional subdivisions of the available parking areas can yield additional savings of travelers’ time and access distances, the marginal benefits decrease rapidly as the number of subdivisions grows.

Suggested Citation

  • Chen, Cheng-Chieh (Frank) & Schonfeld, Paul, 2024. "Optimal clustering analysis for airport parking," Journal of Air Transport Management, Elsevier, vol. 120(C).
  • Handle: RePEc:eee:jaitra:v:120:y:2024:i:c:s0969699724001248
    DOI: 10.1016/j.jairtraman.2024.102659
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.jairtraman.2024.102659?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:jaitra:v:120:y:2024:i:c:s0969699724001248. 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.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.