A nonlinear heuristic modifier for constructing examination timetable
This research focuses on solving an examination timetabling problem by constructing solution using nonlinear heuristic modifier of Graph Coloring Heuristics.Two graph coloring heuristics i.e. largest degree and saturation degree were used within the nonlinear heuristic modifier to generate difficul...
保存先:
| 主要な著者: | , , |
|---|---|
| フォーマット: | 論文 |
| 言語: | English |
| 出版事項: |
JATIT
2017
|
| 主題: | |
| オンライン･アクセス: | http://repo.uum.edu.my/26045/1/JTAIT%2095%2020%202017%205142%205653.pdf http://repo.uum.edu.my/26045/ http://www.jatit.org/volumes/ninetyfive20.php |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
| 要約: | This research focuses on solving an examination timetabling problem by constructing solution using
nonlinear heuristic modifier of Graph Coloring Heuristics.Two graph coloring heuristics i.e. largest degree and saturation degree were used within the nonlinear heuristic modifier to generate difficulty value of each examination, where it was modified non linearly whenever an examination cannot be scheduled in the previous iteration. Next, new ordering of examinations was obtained based on the new difficulty values and
each examination was scheduled until a complete timetable is obtained. The nonlinear heuristic modifier is proposed to set a difficulty value of an examination within a nonlinear range, so that an effective estimation of examination’s difficulty could be obtained. The Toronto benchmark datasets were used in the experiment
where the aim is to obtain an examination schedule with minimum penalty value. It is found that the
proposed method is comparable with other approaches, hence gives better examination ordering. |
|---|