Proceedings. The 21st Digital Avionics Systems Conference
DOI: 10.1109/dasc.2002.1067897
|View full text |Cite
|
Sign up to set email alerts
|

A constraint-programming formulation for dynamic airspace sectorization

Abstract: In this paper we consider the Dynamic Airspace Sectorization Problem (DASP) where airspace is partitioned into a number of sectors, each sector being assigned to a team of air trafEc controllers. The objective of DASP is to balance the controllers' workload among the sectors and to simultaneously minimize the coordination workload between adjacent sectors.This problem is closely related to the Graph Partitioning problems. However, some specific constraints have to be taken into account (e.g., aircraft can not … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 19 publications
0
3
0
Order By: Relevance
“…(2007) use a much more precise and complex workload CP model to dynamically balance the traffic over the sectors of an ATCC in the upper airspace. Other works, like Barnier (2002) uses CP technology as well to optimize the ATCC opening schedules to match the predicted traffic more closely, or even attempt to redesign airspace sectorisation with better balancing like Tran Dac and Baptiste (2003).…”
Section: Context and Related Workmentioning
confidence: 99%
“…(2007) use a much more precise and complex workload CP model to dynamically balance the traffic over the sectors of an ATCC in the upper airspace. Other works, like Barnier (2002) uses CP technology as well to optimize the ATCC opening schedules to match the predicted traffic more closely, or even attempt to redesign airspace sectorisation with better balancing like Tran Dac and Baptiste (2003).…”
Section: Context and Related Workmentioning
confidence: 99%
“…The termination criterion is the desired number of subgraphs (sectors) and desired weight (peak trafficcount) of each sub-graph. Trandac et al [5] proposed a constraint programming approach to partition airspace into sectors such that the controller workload across all the sectors was balanced while at the same time the coordination workload was minimized. Mitchell et al [6] developed a computational geometry technique to achieve dynamic resectorization.…”
Section: Figure 2 Atc Sectors In the Nasmentioning
confidence: 99%
“…The main difference between them lies in the way how they design the new sectors. While DAS provides airspace sectorisations adapted to the demand by designing new operating sectors (Chen et al, 2013;Delahaye et al, 1998;Martinez et al, 2007;Tang et al, 2012;Trandac & Vu Duong, 2002), DAC uses pre-defined static airspace blocks that are grouped in order to create new operating sectors (Kopardekar et al, 2007;Delahaye et al, 1995;Sergeeva et al, 2017Sergeeva et al, , 2015Gianazza, 2019;Gianazza & Durand, 2020;Gianazza, 2010;Verlhac, C. and Manchon, S., 2005;Treimuth, 2018;.…”
Section: Ii12 Capacity Managementmentioning
confidence: 99%