Strategic Vertiport Placement for Airport Access: Utilizing Urban Air Mobility for Accelerated and Reliable Transportation
Open Access
- 14 September 2025
- journal article
- research article
- Published by MDPI AG in Infrastructures
- Vol. 10 (9) , 242
Abstract
Airport-bound access and egress trips comprise a significant portion of total ground transportation trips, especially in regions served by large airports. Connecting urban areas with airports under minimal travel delays can be challenging, with traffic congestion along busy connecting corridors being a common phenomenon. Urban Air Mobility (UAM) is a new transportation mode envisioned to reduce travel times using specific aircraft, such as electric (and non-electric) Vertical or Short Take-off and Landing aircraft (e/VTOLs and STOLs, respectively). The operation of these aircraft requires take-off and landing infrastructure known as vertiports. A strategic infrastructure placement framework was introduced, utilizing and adapting the Capacitated Facility Location Problem (a-CFLP) and the Maximal Covering Location Problem (a-MCLP) with capacity constraints. An adapted capacitated k-means algorithm and a greedy heuristic were considered for the solution of the a-CFLP, while the a-MCLP was formulated as a mixed-integer linear programming problem. The proposed framework was applied in the Chicago Metropolitan Area, revealing that various trade-offs regarding coverage and accessibility, versus operational costs (number of facilities, facility capacity, and service radius), exist. The results showed that, depending on vertiport capacity and service radius capabilities, a range of 5 to 12 vertiports can sufficiently address the demand (above 95% demand coverage) and, with respect to accessibility, serve a moderate UAM demand scenario of 6124 daily requests, as identified for this region.Keywords
This publication has 113 references indexed in Scilit:
- Network and Discrete Location: Models, Algorithms, and Applications, Second Edition2013
- Approximating the two-level facility location problem via a quasi-greedy approachMathematical Programming, 2006
- Analysis of a Local Search Heuristic for Facility Location ProblemsJournal of Algorithms, 2000
- Greedy Strikes Back: Improved Facility Location AlgorithmsJournal of Algorithms, 1999
- Capacitated facility location: Separation algorithms and computational experienceMathematical Programming, 1998
- Coverage problems and visibility regions on topographic surfacesAnnals of Operations Research, 1989
- A method for solving to optimality uncapacitated location problemsAnnals of Operations Research, 1989
- Heuristics for the fixed cost median problemMathematical Programming, 1982
- An efficient heuristic procedure for the capacitated warehouse location problemNaval Research Logistics Quarterly, 1974
- A branch‐bound algorithm for the capacitated facilities location problemNaval Research Logistics Quarterly, 1969