Efficient ride matching for optimized resource allocation in a UAM vertiport network

Abstract

A significant reduction of door-to-door travel time is a key promise of urban air mobility (UAM), which requires the design of efficient route networks. The vertiport positioning problem is a crucial aspect of UAM network design, targeting to locate sufficient throughput capacity in spatial proximity to areas of high demand. In the scope of this presentation, an overview on various investigations addressed in the literature will be given. Predominantly, these investigations comprise analyses regarding achievable time savings, covering location problems and competitiveness with other transport modes. Other examinations are focused on demand and travel behavior, taking network topology and network density into account. Further relevant research in that context is available on the capacity modeling of single vertiports, for instance depending on the number of landing pads, parking positions and gates. Procedures for optimal traffic sequencing of incoming and outgoing vehicles represent a further research field. Results of this presentation highlight a significant research gap regarding the optimal distribution of resources inside a vertiport network, such as parking positions, landing pads as well as infrastructure for charging or maintenance purposes. We propose a four-step design methodology aiming at conducting this resource distribution. The key component of this methodology is an algorithm describing ride matching and tour planning that enables efficient fleet operations. We exemplarily apply a prototype of our model to derive local demand for parking positions inside a vertiport network, and present initial simulation results. The method presented will be applied on an exemplary set of vertiport positions in Hamburg City and potential use cases for further investigations will be discussed.