A method for urban air mobility network design using hub location and subgraph isomorphism

Rising concerns related to the effects of traffic congestion have led to the proposal of many alternative solutions, including the idea of Urban Air Mobility (UAM), which uses electric aircraft to service routes in dense urban areas. UAM networks rely on an infrastructure of vertiports, which are closely tied to the ability of the UAM service to operate effectively. This research addresses identifying desirable locations for vertiports while taking into account vehicle limitations, desired operational strategies, and the possibility of passenger trips involving more than two vertiports. The vertiport selection problem is presented as a modified single-allocation p-hub median location problem that incorporates elements of subgraph isomorphism to create structured networks to allow for public transit operations. Because the problem is NP-hard, five heuristic algorithms are developed to find potential solutions with acceptable computation times. The methods are compared to the optimal solution in three different areas of the United States. The most effective of these methods are found to be within 10% of the optimal solution on average, and results indicate that they scale well to larger networks. General trends from the three case study regions examined are also briefly discussed.

Automated summary

The study focuses on Urban Air Mobility (UAM) and the selection of vertiport locations, developing five heuristic algorithms to find potential solutions with acceptable computation times. By comparing results in different regions of the United States, it is shown that the methods are effective in finding solutions within 10% of the optimal solution on average and are scalable to larger networks.