发表机构
KTH Royal Institute of Technology; Dalian University of Technology（皇家理工学院; 大连理工大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文针对带替代飞行路径的按需城市空中交通机队调度问题，提出定制分支切割算法，实验表明其性能优于基线方法，且增加候选路径数量可降低目标值与噪声暴露。
AI 中文摘要
相同 vertiports 间的多条候选飞行路径为管理按需城市空中交通（UAM）的噪声暴露与巡航间隔提供了灵活性。本文提出了带替代飞行路径的机队调度问题（FSP-AFP），针对有限规模的机队构建了时间扩展的机队流模型，其中每架服务航班或空机重定位航班均从连接其起终点 vertiports 的预定义替代路径集中分配一条平面路径。这些路径选择与巡航高度、出发时间及重定位运动被联合优化，同时维持航空器流平衡，并强制要求在同一高度同时巡航的航班间满足几何间隔约束。目标函数综合考虑了飞行成本、服务出发延误及人口加权噪声暴露。定制的分支切割算法基于请求增强冲突图构建了三类互补团结构，利用了物理飞行冲突、请求排他性及请求-路径关系。计算实验表明，与采用 Gurobi 原生惰性约束功能的基线方法相比，所提算法通常能获得更优的下界，且对所有测试实例均能找到可行解，同时平均生成的割数量更少，处理的搜索节点平均数降低了43.16倍。运营案例研究显示，在巡航间隔约束下，将每对 vertiports 的候选平面路径数量从1条增加至4条，可使加权目标值降低6.71%，建模噪声暴露降低15.14%；进一步增加候选路径数量仅能使目标值获得边际提升。这些发现表明，在 UAM 中协调替代飞行路径、调度及机队循环具有重要价值。
英文摘要
Multiple candidate flight paths between the same vertiports provide flexibility for managing noise exposure and cruise separation in on-demand urban air mobility (UAM). This paper introduces the fleet scheduling problem with alternative flight paths (FSP-AFP). We develop a time-expanded fleet-flow formulation for a finite aircraft fleet, in which each service or empty repositioning flight is assigned a planar path from a predefined set of alternatives connecting its origin and destination vertiports. These path choices are jointly optimized with cruise altitudes, departure times, and repositioning movements, while maintaining aircraft flow balance and enforcing geometric separation between flights cruising concurrently at the same altitude. The objective combines flight costs, service departure delays, and population-weighted noise exposure. A tailored branch-and-cut algorithm incorporates three complementary clique constructions based on a request-augmented conflict graph, exploiting physical flight conflicts, request exclusivity, and request-route relationships. Computational experiments show that, compared with a baseline implemented using Gurobi's native lazy-constraint functionality, the proposed algorithm generally obtains stronger lower bounds and finds feasible solutions for all test instances, while generating fewer cuts on average and achieving a 43.16-fold reduction in the mean number of processed search nodes. An operational case study shows that increasing the number of candidate planar routes per vertiport pair from one to four reduces the weighted objective by 6.71% and modeled noise exposure by 15.14% under the cruise-separation constraints. Further increases in the number of candidate routes yield only marginal improvement in the objective value. These findings show the value of coordinating alternative flight paths, scheduling, and fleet circulation in UAM.
Comments34 pages, 9 figures
