Airspace Sectorisation using Constraint Programming
Peter Jägare · KTH Publication Database DiVA (KTH Royal Institute of Technology) · 2011
Given a set of cells and a set of flight routes passing through these cells, we need to cluster cells into a given number of sectors, ensuring an even workload over all sectors, and fulfilling several other constraints on the wellformedness of sectors. The sectorisation is done by using constraint programming. Several propagators are designed to ensure the correctness of the sectorisation.