Airspace Sectorisation using Constraint Programming
Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
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.
Place, publisher, year, edition, pages
IT, 11 021
IdentifiersURN: urn:nbn:se:uu:diva-155783OAI: oai:DiVA.org:uu-155783DiVA: diva2:428131
Master Programme in Computer Science
Pearson, JustinJansson, Anders