We consider the Airspace Sectorization Problem (ASP) in which airspacehas to be partitioned into a given number of sectors, each of whichbeing assigned to a team of air traffic controllers. The objective isto minimize the coordination workload between adjacent sectors whilebalancing the total workload of controllers. Many specificconstraints, including both geometrical and aircraft relatedconstraints are taken into account. The problem is solved in aconstraint programming framework. Experimental results show that ourapproach can be used on real life problems.
