Air-traffic complexity resolution in multi-sector planning

摘要

This paper considers the problem of minimizing the traffic complexities in an airspace of adjacent sectors. The traffic complexity of a sector is determined by the numbers of flights within it, near its border, and on non-level segments within it. The dimensions of complexity resolution involve changing the take-off times of non-airborne flights, changing the approach times into the chosen airspace of airborne flights by slowing and accelerating within the two layers of feeder sectors around that airspace, as well as changing the altitude at way-points in that airspace. Experiments with European flight profiles from the Central Flow Management Unit show that these forms of resolution can lead to significant complexity reductions and rebalancing.