Airspace sectorization with constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles RAIRO - Operations Research Year : 2005

Airspace sectorization with constraints


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.
Not file

Dates and versions

inria-00123795 , version 1 (11-01-2007)


  • HAL Id : inria-00123795 , version 1


Huy Tran Dac, Philippe Baptiste. Airspace sectorization with constraints. RAIRO - Operations Research, 2005, 39, pp.105--122. ⟨inria-00123795⟩
59 View
0 Download


Gmail Facebook Twitter LinkedIn More