Performance analysis 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 a feasible examination timetable, while meta-heuristics are applied for impr...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Institute of Advanced Engineering and Science
2020
|
| Subjects: | |
| Online Access: | https://umpir.ump.edu.my/id/eprint/46320/1/Performance%20analysis%20of%20graph%20heuristics%20and%20selected%20trajectory.pdf https://doi.org/10.11591/ijeei.v8i1.1660 https://umpir.ump.edu.my/id/eprint/46320/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|