Research of Hierarchical Vertiport Location Based on Lagrange Relaxation

Abstract

With the rise of the low-altitude urban traffic system, urban air mobility (UAM) has developed rapidly. As a critical component of the UAM system, the strategic layout of vertiports helps divert ground traffic pressure. To satisfy various demand patterns, different vertiport levels are needed, so we focus on the hierarchical vertiport location problem. Considering the capacity limitation, a median location model is established to minimize vertiport construction cost, passenger commuting cost, and penalty cost. For the nonlinear term in the objective function, the Big-M method is employed. Based on the reformulated model, we improve the branch-and-bound algorithm (LVBB) to solve it, where the Lagrange relaxation method is used to decompose the large-scale problem into parallel subproblems and compute the lower bound, and the variable neighborhood search algorithm is used to obtain the upper bound. Numerical experiments are performed in the 11 administrative districts of Nanjing, China. The results demonstrate that the proposed location scheme effectively balances vertiport construction cost and passenger commuting cost while satisfying capacity limitations. It also significantly reduces commuting time to improve passenger satisfaction. This scheme can offer strategic guidance for infrastructure planning in UAM.