A branch-­and-­price algorithm for Dynamic Sector Configuration

Abstract : Air traffic generates workload for the air traffic controllers in charge of the airspace. For a large airspace, a single air traffic controller is not able to manage all this workload and the airspace is divided into sectors, each of them being assigned to a controller. When the traffic demand is decreasing during the night, the sectors are gathered together into groups to reduce the number of controllers in operation. Nowadays, this regrouping is performed empirically by airspace experts. In this paper, we show how the branch-and-price method can be used to compute a balanced grouping of air traffic control sectors to optimally reduce the number of controller teams during daily low flow periods.
Complete list of metadatas

https://hal.laas.fr/hal-01481466
Contributor : Sandra Ulrich Ngueveu <>
Submitted on : Thursday, March 2, 2017 - 4:16:38 PM
Last modification on : Friday, October 11, 2019 - 8:23:28 PM
Long-term archiving on : Wednesday, May 31, 2017 - 4:58:43 PM

File

SECTOR_TREIMUTH_2016_revised.p...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01481466, version 1

Citation

Tambet Treimuth, Daniel Delahaye, Sandra Ulrich Ngueveu. A branch-­and-­price algorithm for Dynamic Sector Configuration. 8th International Conference on Applied Operational Research (ICAOR), Jun 2016, Rotterdam, Netherlands. pp.47-53. ⟨hal-01481466⟩

Share

Metrics

Record views

496

Files downloads

115