Airspace sectorization with constraints

Abstract : 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.
Type de document :
Article dans une revue
RAIRO - Operations Research, EDP Sciences, 2005, 39, pp.105--122
Liste complète des métadonnées
Contributeur : Philippe Baptiste <>
Soumis le : jeudi 11 janvier 2007 - 10:00:07
Dernière modification le : jeudi 10 mai 2018 - 02:06:33


  • HAL Id : inria-00123795, version 1



Huy Tran Dac, Philippe Baptiste. Airspace sectorization with constraints. RAIRO - Operations Research, EDP Sciences, 2005, 39, pp.105--122. 〈inria-00123795〉



Consultations de la notice