Air-traffic complexity resolution in multi-sector planning using constraint programming

Flener, Pierre and Pearson, Justin and Ågren, Magnus and Garcia Avello, Carlos and Çeliktin, Mete and Dissing, Søren (2007) Air-traffic complexity resolution in multi-sector planning using constraint programming. In: Proceedings of ATM'07: the 7th USA/Europe R&D Seminar on Air Traffic Management, 2-5 July 2007, Barcelona, Spain.

Full text not available from this repository.

Official URL:


Using constraint programming, we effectively model and efficiently solve the problem of balancing and minimising the traffic complexities of an airspace of adjacent sectors. The traffic complexity of a sector is here defined in terms of the numbers of flights within it, near its border, and on non-level segments within it. The allowed forms of complexity resolution are the changing of the take-off times of not yet airborne flights, the changing of the remaining approach times into the chosen airspace of already airborne flights by slowing down and speeding up within the two layers of feeder sectors around that airspace, as well as the changing of the levels of passage over way-points in that airspace. Experiments with actual European flight profiles obtained from the Central Flow Management Unit (CFMU) show that these forms of complexity resolution can lead to significant complexity reductions and rebalancing.

Item Type:Conference or Workshop Item (Paper)
ID Code:3675
Deposited By:Magnus Ņgren
Deposited On:12 Oct 2009
Last Modified:18 Nov 2009 16:25

Repository Staff Only: item control page