Constructing population of initial solutions for curriculum – based course timetabling problem
This paper presents an investigation of a combination of graph coloring heuristics in construction approach in University course timetabling problem (UCTP) to produce a population of initial solutions. The graph coloring heuristics were set as individual, combination of three heuristics. In addition...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Conference or Workshop Item |
| 語言: | English |
| 出版: |
2012
|
| 主題: | |
| 在線閱讀: | http://repo.uum.edu.my/5566/1/CONTRUCTING_POPULATION_OF_INITIAL.pdf http://repo.uum.edu.my/5566/ |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | This paper presents an investigation of a combination of graph coloring heuristics in construction approach in University course timetabling problem (UCTP) to produce a population of initial solutions. The graph coloring heuristics were set as individual, combination of three heuristics. In addition, several steps of courses assignment were applied to all the settings. All settings of heuristics are then tested on the same curriculum - based problem instances and are compared with each other in terms of number of population produced. The results can be used for improvement phase which are the second phase of UCTP. This approach allows generalization over a set of problems instead of producing feasible timetables for some of the problems only. Future work will use the best settings of heuristics to the improvement phase in population-based improvement algorithm. |
|---|