The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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...
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...
Download Results (CSV)