Change search
ReferencesLink to record
Permanent link

Direct link
Comparison of algorithms forautomated university scheduling
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Schedule generation is a common real-world problem, that has been shown to behard to solve. In a scheduling algorithm, various constraints related to scheduling are the inputs and a schedule satisfying these constraints is the output. In this report, two algorithms for schedule generation are compared: Tabu Searchand a Genetic Algorithm. How well the algorithms perform for generating schedules from constraint input of dierent sizes is assessed, as well as how the performance of the algorithms is aected by varying parameters of the algorithm.The major conclusion drawn is that there is no major dierence between how well Tabu Search and the Genetic Algorithm scale when faced with a larger input size.

Place, publisher, year, edition, pages
National Category
Computer Science
URN: urn:nbn:se:kth:diva-157701OAI: diva2:771160
Available from: 2014-12-12 Created: 2014-12-12 Last updated: 2014-12-12Bibliographically approved

Open Access in DiVA

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

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 200 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: 142 hits
ReferencesLink to record
Permanent link

Direct link