Scalability of a Genetic Algorithm that solves a UniversityCourse Scheduling Problem Inspired by KTH
Scheduling university courses is a combinatorial optimization problem where a set of events such as lectures, seminars and labs have to be scheduled into certain time slots while taking various constraints into account. The problem is considered dicult by conventional methods andthe amount of requir...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Skolan för datavetenskap och kommunikation (CSC)
2014
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157687 |