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...
Saved in:
主要作者: | |
---|---|
格式: | Thesis |
語言: | English |
出版: |
2013
|
主題: | |
在線閱讀: | http://eprints.utm.my/id/eprint/35854/1/SalisuMusaBorodoMFSKSM2013.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
成為第一個發表評論!