This paper aims to find optimal vertiport locations for an urban air mobility service in a metropolitan area. This location optimization problem has no specific candidates, so its search space is finely discretized. The optimal locations are defined as the set of locations that maximize the total revenue. To estimate the revenue, actual traffic data and a mode choice model are used to forecast the demand. Since the search space of the location optimization problem is huge, a local search-based algorithm is proposed to find a near-optimal solution in a short computation time. The proposed algorithm is applied to the Seoul metropolitan area, Republic of Korea, and the optimal vertiport network is found. This paper also analyzes the impact of operational parameters, such as the number, distance, and catchment area of vertiports and the fare and speed of aircraft, at the optimal locations. The results of this study can provide insights to stakeholders.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Vertiport Locations Optimization in Discrete Search Space


    Contributors:


    Publication date :

    2023-10-01


    Size :

    9426283 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    COMPACT VERTIPORT WITH EFFICIENT SPACE UTILIZATION

    TIGHE JAMES JOSEPH / LONG GEOFFREY ALAN / TZARNOTZKY URI | European Patent Office | 2024

    Free access

    Vertiport Characteristics

    D. J. Peisen / S. V. Berardo / J. R. Ludders et al. | NTIS | 1996


    COMPACT VERTIPORT WITH EFFICIENT SPACE UTILIZATION

    TIGHE JAMES JOSEPH / LONG GEOFFREY ALAN / TZARNOTZKY URI | European Patent Office | 2025

    Free access

    Vertiport management platform

    SHANNON PETER F | European Patent Office | 2020

    Free access

    Dynamic Vertiport Configuration

    PETERSEN JON DAVID / ALEXANDER REX J / SWAINTEK III STANLEY STEPHEN | European Patent Office | 2024

    Free access