The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
The examination timetabling problem has attracted the interested of many researchers over the years. However, this problem is difficult to solve due to the lack of benchmark dataset and many constraints that need to be satisfied in examination timetabling problem. Currently, Universiti Malaysia...
Saved in:
主要作者: | Lee Jian, Hao |
---|---|
格式: | Undergraduates Project Papers |
語言: | English |
出版: |
2013
|
主題: | |
在線閱讀: | http://umpir.ump.edu.my/id/eprint/6975/1/CD7651.pdf http://umpir.ump.edu.my/id/eprint/6975/ |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Graph coloring heuristics for solving examination timetabling problem at Universiti Utara Malaysia
由: Abdul Rahman, Syariza, et al.
出版: (2014) -
Problem solving steps in online PBL
由: Shahbodin, Faaizah, et al.
出版: (2010) -
Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem
由: Ashis Kumar, Mandal, et al.
出版: (2015) -
The graph heuristic with great deluge algorithm to solve the ITC2007 examination timetabling problem
由: Chuan, Wei Kiat
出版: (2014) -
Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem
由: Mandal, Ashis Kumar, et al.
出版: (2020)