A Dynamic Programming Algorithm for Robust Runway Scheduling
A Dynamic Programming Algorithm for Robust Runway Scheduling
复制标题
鲁棒跑道调度的动态规划算法
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
H. Balakrishnan
中科院分区：
文献类型：
--
作者：
Bala G. Chandran;H. Balakrishnan
提出了一种对系统不确定性引起的扰动具有鲁棒性的机场跑道运行计划生成算法。该算法计算的权衡曲线之间的跑道吞吐量和概率的随机偏差的飞机从时间表违反系统的约束条件，并需要空中交通管制员的干预。该算法适应终端区系统所施加的各种操作约束，例如连续飞机之间的最小间隔要求，每架飞机的最早和最晚时间，飞机之间的优先约束和有限的灵活性，在偏离先到先服务（FCFS）的顺序提供给空中交通管制员（一个概念称为约束位置转移）。当最大允许的FCFS顺序的位置偏移的数量是由一个常数的限制，该算法的复杂性是O（n（L/isin）3），其中n是飞机的数量，L是最大的最新和最早的到达时间之间的差异在所有飞机，和e是所需的输出精度。
An algorithm for generating schedules of airport runway operations that are robust to perturbations caused by system uncertainty is presented. The algorithm computes a tradeoff curve between runway throughput and the probability that random deviations of aircraft from the schedule violate system constraints and require intervention from air traffic controllers. The algorithm accommodates various operational constraints imposed by the terminal-area system such as minimum separation requirements between successive aircraft, earliest and latest times for each aircraft, precedence constraints among aircraft and the limited flexibility in deviating from the first-come-first-served (FCFS) order afforded to air traffic controllers (a concept known as Constrained Position Shifting). When the maximum allowable number of position shifts from the FCFS order is bounded by a constant, the complexity of the algorithm is O(n(L/isin)3), where n is the number of aircraft, L is largest difference between the latest and earliest arrival time over all aircraft, and e is the desired output accuracy.