Change search
ReferencesLink to record
Permanent link

Direct link
Airspace Sectorisation using Constraint Programming
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2011 (English)Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

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
URN: urn:nbn:se:uu:diva-155783OAI: diva2:428131
Educational program
Master Programme in Computer Science
Available from: 2011-06-29 Created: 2011-06-29 Last updated: 2011-06-29Bibliographically approved

Open Access in DiVA

fulltext(393 kB)624 downloads
File information
File name FULLTEXT01.pdfFile size 393 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 624 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 473 hits
ReferencesLink to record
Permanent link

Direct link