首页 >

基于引导式策略梯度的航班着陆调度优化方法-AFC2026增刊

王兴隆,余国乐,冯小荣   

  1. 中国民航大学
  • 收稿日期:2026-05-25 修回日期:2026-07-22 出版日期:2026-07-24 发布日期:2026-07-24
  • 通讯作者: 王兴隆
  • 基金资助:
    国家重点研发计划

An Optimization Method for Aircraft Landing Scheduling Based on Guided Policy Gradient

  • Received:2026-05-25 Revised:2026-07-22 Online:2026-07-24 Published:2026-07-24
  • Contact: Xing-Long ---WANG
  • Supported by:
    National Key R&D Program of China

摘要: 航班着陆调度问题(Aircraft Landing Problem, ALP)是一个具有严苛安全间隔约束的高维非线性组合优化难题。针对大规模流量场景下,群体智能算法面临“维度灾难”难以满足实时需求,以及传统强化学习在处理硬约束时收敛困难的问题,提出一种引导式策略梯度方法(Guided Policy Gradient, GPG)。首先,构建了基于注意力机制的序列决策网络,利用其多头注意力机制深度捕捉航班间复杂的时空关联特征,实现对全局调度状态的精准感知。其次,针对大规模场景下的维度灾难,提出一种动态受限候选集掩码(Dynamic Restricted Candidate Mask, DRCM)策略,通过目标时间准则实时筛选最具调度关联性的航班子集,将高维动作空间有效压缩至固定维度的滚动决策窗口,显著降低了策略搜索成本。最后,提出一种松弛引导(Relaxed Guidance)机制,通过将离散的硬间隔约束转化为平滑的梯度引导路径,有效化解了 ALP 决策空间的不可导难题,并结合指数移动平均(EMA)基准线机制降低策略梯度的方差,提升了模型在海量随机样本下的训练稳定性。采用OR-Library数据集进行对所提方法进行验证。实验表明,所提模型求解结果优于先到先服务(FCFS)策略, 位移决策(DALP)算法,分散搜索(SS)算法,生物仿生(BA)算法,求解精度平均提升44.58%,20.69%,3.16%,0.84%。在小规模数据集上,与混合粒子群优化-局部搜索(RH-HPSO-LS)算法相近。在大样本数据集上,在保证计算精度的同时,时间效率优于对比算法,表明该算法能够兼顾求解效率与约束鲁棒性。

关键词: 航班着陆调度, 组合优化, 强化学习, 策略梯度, 注意力机制

Abstract: The Aircraft Landing Problem (ALP) is a high-dimensional, non-linear combinatorial optimization challenge characterized by stringent safety separation constraints. To address the "curse of dimensionality" faced by swarm intelligence algorithms in large-scale traffic scenarios—which struggle to meet real-time requirements—and the convergence difficulties of traditional Reinforcement Learning (RL) when handling hard constraints, this paper proposes a Guided Policy Gradient (GPG) method. First, a sequence decision network based on the Attention Mechanism is constructed. Its multi-head attention layers are utilized to capture complex spatio-temporal correlations between flights, enabling precise perception of the global scheduling state. Second, to tackle high dimensionality, a Dynamic Restricted Candidate Mask (DRCM) strategy is introduced. By applying target-time criteria to filter the most relevant flight subsets in real-time, the high-dimensional action space is effectively compressed into a fixed-size rolling decision window, significantly reducing policy search costs. Finally, a Relaxed Guidance mechanism is proposed to transform discrete hard separation constraints into smooth gradient guidance paths, effectively resolving the non-differentiable issues within the ALP decision space. This is combined with an Exponential Moving Average (EMA) baseline mechanism to reduce policy gradient variance and enhance training stability under massive stochastic samples. The proposed method is validated using the OR-Library dataset. Experimental results demonstrate that the model outperforms the First-Come-First-Served (FCFS) strategy, the Displacement and Location Planning (DALP) Algorithm, Scatter Search (SS), and the Bio-inspired Algorithm (BA). Specifically, the solution accuracy is improved by an average of 44.58%, 20.69%, 3.16%, and 0.84%, respectively. On small-scale datasets, the performance is comparable to the Hybrid Particle Swarm Optimization with Local Search (RH-HPSO-LS). On large-scale datasets, the proposed algorithm maintains high precision while demonstrating superior time efficiency compared to existing methods, indicating its ability to balance computational efficiency with constraint robustness.

Key words: aircraft landing sheduling, combinatorial optimization, reinforcement learning, policy gradient, attention mechanism

中图分类号: