| Issue |
RAIRO-Oper. Res.
Volume 39, Number 2, April-June 2005
|
|
|---|---|---|
| Page(s) | 105 - 122 | |
| DOI | https://doi.org/10.1051/ro:2005005 | |
| Published online | 15 October 2005 | |
Airspace sectorization with constraints
1
College of Information Technology, Can Tho University, Viet Nam.
2
CNRS LIX, École Polytechnique,
91128 Palaiseau, France; Philippe.Baptiste@polytechnique.fr
3
Eurocontrol Experimental Centre, Centre de Bois des Bordes,
BP15, 91222 Bretigny sur Orge Cedex, France.
Received:
6
September
2003
Accepted:
24
March
2005
We consider the Airspace Sectorization Problem (ASP) in which airspace has to be partitioned into a given number of sectors, each of which being assigned to a team of air traffic controllers. The objective is to minimize the coordination workload between adjacent sectors while balancing the total workload of controllers. Many specific constraints, including both geometrical and aircraft related constraints are taken into account. The problem is solved in a constraint programming framework. Experimental results show that our approach can be used on real life problems.
Key words: Airspace sectorization / constraint programming.
© EDP Sciences, 2005
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.