Skip to Main content Skip to Navigation

Dynamic optimization of airspace sector grouping

Abstract : The current airspace configuration is highly structured, fixed and is less responsive to changes causing the overall system to lack the flexibility, adaptability, and responsibility needed to handle the increasing air traffic demands in the near future. The work presented in this thesis aims at improving the flexibility and adaptability of today’s airspace management in Europe in a pre-tactical context. We focus on the development of a method to support a process of automatic generation of a sequence of sector configurations composed of predefined sectors. Airspace configurations should be dynamically adjusted to provide maximum efficiency and flexibility in response to demand fluctuations. We dynamically build configurations by combining existing elementary sectors. In this step, any sector combination which forms controllable airspace blocks is eligible and may be used during the day of operation. In this work, we developed efficient methods to solve DAC problem. We formulated and study the sectorization problem from an algorithmic point of view. We proposed methods based on a mathematical modeling and heuristic optimization techniques. We also introduced here an approach to evaluate the workload inside sector
Document type :
Complete list of metadatas

Cited literature [51 references]  Display  Hide  Download
Contributor : Laurence Porte <>
Submitted on : Tuesday, August 18, 2020 - 5:52:51 PM
Last modification on : Tuesday, October 20, 2020 - 10:32:07 AM


Files produced by the author(s)


  • HAL Id : tel-02917163, version 1



Tambet Treimuth. Dynamic optimization of airspace sector grouping. Optimization and Control [math.OC]. INPT, 2018. English. ⟨NNT : 2018INPT0013⟩. ⟨tel-02917163⟩



Record views


Files downloads