Skip to Main content Skip to Navigation
Journal articles

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.
Document type :
Journal articles
Complete list of metadata

https://hal.inria.fr/inria-00123795
Contributor : Philippe Baptiste <>
Submitted on : Thursday, January 11, 2007 - 10:00:07 AM
Last modification on : Thursday, March 5, 2020 - 6:21:23 PM

Identifiers

  • HAL Id : inria-00123795, version 1

Collections

Citation

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

Share

Metrics

Record views

171