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

An efficient algorithm for multi-modal skyport location problem with choice-based demand

Author

Listed:
  • Kim, Gwang
  • Jeong, Yoonjea
  • Shin, Youngchul

Abstract

This study presents the operation of urban air mobility (UAM), an innovative transportation technology aimed at alleviating traffic congestion in cities. A key consideration for the successful introduction and efficient operation of the transportation is to decide on locations of skyports, which are stations for vertical take-off and landing of air mobility. In this study, we cover a skyport location problem incorporating choice probabilities of transportation modes for each user by applying a binary logit model. The choice probabilities are predicted by considering factors such as fare, travel time, and social acceptance. We propose two mathematical formulations associated with the skyport location problem; one is to maximize the proportion of users who choose the UAM service and the other is to minimize the total sum of the travel time. The two models are NP-hard problems, necessitating an effective and efficient solution methodology for the problem. This study presents a methodology based on a cross-entropy algorithm, which is known for efficiently solving combinatorial optimization problems. We also validate the good performances of the solution methodology through numerical experiments.

Suggested Citation

  • Kim, Gwang & Jeong, Yoonjea & Shin, Youngchul, 2025. "An efficient algorithm for multi-modal skyport location problem with choice-based demand," Socio-Economic Planning Sciences, Elsevier, vol. 100(C).
    • Handle: RePEc:eee:soceps:v:100:y:2025:i:c:s003801212500076x
    DOI: 10.1016/j.seps.2025.102227
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S003801212500076X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.seps.2025.102227?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:soceps:v:100:y:2025:i:c:s003801212500076x. 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/locate/seps .

    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.