Capacity and Throughput of Urban Air Mobility Vertiports with a First-Come, First-Served Vertiport Scheduling Algorithm

In this paper, a first-come, first-served vertiport scheduling algorithm for Urban Air Mobility (UAM) was exercised to assess and compare the capacity and throughput of various vertiport configurations. The scheduler models each vertiport by the number of vertipads and parking spaces, and manages reservations on timelines for those vertiport resources, at a level of fidelity suitable for fast-time and system-level analyses of UAM concepts and other airspace studies. The paper defines the theoretical model that can be used to estimate the capacity of various vertiport configurations. The theoretical model provides an understanding of the conditions that can lead to either a parking space-limited or a vertipad-limited vertiport. Examples of potential throughput for some vertiport configurations are provided using both a queueing approach as well as a simulated UAM demand scenario. The study demonstrated that a first-come, first-served scheduling approach can have inefficiencies in the use of the vertiport resources. The inefficiencies can increase as the number of resources increases. Nonetheless, 80% or better peak throughput to capacity ratio was observed for most vertiport configurations.