Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem
Examination timetabling problem is hard to solve due to its NP-hard nature, with a large number of constraints having to be accommodated. To deal with the problem effectually, frequently heuristics are used for constructing feasible examination timetable while meta-heuristics are applied for improvi...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Institute of Advanced Engineering and Science
2020
|
| Subjects: | |
| Online Access: | http://umpir.ump.edu.my/id/eprint/29896/1/Performance%20analyses%20of%20graph%20heuristics%20and%20selected%20trajectory.pdf |