taptap下载安装安卓学报 ›› 2025, Vol. 43 ›› Issue (2): 31-37.

• 空域融合安全运行 • 上一篇    下一篇

航空器动态滑行路径优化

  

  1. 1. 上海工程技术大学管理学院,上海
    201620;2. 南京航空航天大学民航学院,南京
    211106;
    3. 华为技术有限公司运营商 BG,广东 深圳
    518129
  • 收稿日期:2024-04-24 修回日期:2024-11-18 出版日期:2025-05-14 发布日期:2025-05-14
  • 作者简介:高金敏(1990— ),女,山东临沂人,副教授,博士,研究方向为航空运营优化.
  • 基金资助:
    教育部人文社会科学研究项目(23YJC790027)

Optimization of aircraft dynamic taxiing path

  1. 1. School of Management, Shanghai University of Engineering Science, Shanghai 201620, China;
    2. College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 211106, China;
    3. Operators BG, Huawei Technology Co., Ltd., Shenzhen 518129, Guangdong, China 
  • Received:2024-04-24 Revised:2024-11-18 Online:2025-05-14 Published:2025-05-14

摘要:

为减少航空器滑行时间,提高机场场面的使用效率,本文建立了航空器动态滑行混合整数线性规划模型。
该模型以运行总成本最小为目标,以滑行安全间隔和冲突避免等为约束条件,模型本质是动态旅行商问题,
为此,基于广州白云国际机场(简称白云机场)场面构型数据和 33 架次起降航班数据开展了计算试验。为了
便于研究,本文先对物理场面进行了图论化处理,将交点、端点、分段点作为点,跑道、滑行道分段作为边,
建立了图论模型,并根据进(离)港情况建立有向图,以保证航空器滑向停机位(跑道);在处理穿越跑道上,
采用了特殊点设计,使其避免与起飞航班发生冲突;为了采用 Cplex 优化器求解,模型对非线性化约束进行
了线性化处理;为了验证模型的正确性,先开展了不考虑冲突的计算试验,证明其能够找到最短路径,然后
附上使用时间标识,即时间窗,进行避免冲突的动态优化路径计算。 结果表明,航空器动态滑行混合整数线
性规划模型能有效获得动态起降滑行优化路径,在白云机场采用东西侧分开运作,即跑道指派“就近模式”
下,可用于航空器滑行优化调度。

关键词:

Abstract:

To reduce aircraft taxiing time and improve the efficiency of airport surface utilization, this paper establishes a
mixed integer linear programming model for aircraft dynamic taxiing. The model aims to minimize the total operating cost and is constrained by taxi safety intervals and conflict avoidance. The essence of the model belongs to the
dynamic traveling salesman problem (TSP). Therefore, computational experiments are conducted based on the scene
configuration data and 33 takeoff and landing flight data of Guangzhou Baiyun International Airport (Baiyun Airport). For the convenience of research, this article first applies graph theory processing to the physical scene to establish a graph theory model, using intersection points, endpoints, and segmentation points as points, and runway
and taxiway segmentation as edges. Based on the arrival (departure) situation, a directed graph is established to
ensure that the aircraft slides towards the parking position (runway). Special point designs have been adopted to
avoid conflicts with departing flights when handling runway crossings. In order to solve the problem using Cplex
optimizer, the model linearizes the nonlinear constraints. In order to verify the correctness of the model, a calculation experiment is conducted without considering conflicts to prove its ability to find the shortest path. Then, a time
stamp, i.e. a time window, was attached to perform calculation of dynamic optimization path to avoid conflicts. The
results indicate that the mixed integer linear programming model for aircraft dynamic taxiing can effectively obtain
the optimized path for dynamic takeoff and landing taxiing. In Baiyun Airport, the east-west separated operation,
i.e. the runway assignment "nearby mode", can be used for aircraft taxiing optimization scheduling

Key words:

traveling salesman problem

中图分类号: 

Baidu
map