Air-traffic complexity resolution in multi-sector planning

Pierre Flener, Justin Pearson, Ågren, Magnus, Carlos Garcia-Avello, Çeliktin, Mete and Dissing, Søren

Journal of Air Transport Management, 2007, vol. 13, issue 6, 323-328

Abstract: 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.

Keywords: Air traffic complexity; Complexity resolution; Multi-sector planning; Constraint programming (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0969699707000580
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:jaitra:v:13:y:2007:i:6:p:323-328

DOI: 10.1016/j.jairtraman.2007.05.001

Access Statistics for this article

Journal of Air Transport Management is currently edited by Anne Graham

More articles in Journal of Air Transport Management from Elsevier
Bibliographic data for series maintained by Catherine Liu ().