A hybrid clonal selection algorithm with conflict based ststistics for university course timetabling
The University course timetabling problem involves the allocation of courses to rooms and timeslots subject to satisfaction of hard and soft constraints. The hard constraints must be satisfied, while the soft constraints are desired to be satisfied. The problem also has an objectice function that ne...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2013-01.
|
| Subjects: | |
| Online Access: | Get fulltext |