Parallel metaheuristic algorithm for exam timetabling
Exam timetabling is a computationally intractable problem, which requires heuristic techniques for producing good sub-optimal solutions within reasonable execution time. For large numbers of exams and students, sequential algorithms are likely to be time consuming. The purpose of this work is to pre...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | conferenceObject |
| Published: |
2010
|
| Online Access: | http://hdl.handle.net/10725/7952 http://dx.doi.org/10.1109/ICNC.2010.5583143 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://ieeexplore.ieee.org/abstract/document/5583143/keywords |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Exam timetabling is a computationally intractable problem, which requires heuristic techniques for producing good sub-optimal solutions within reasonable execution time. For large numbers of exams and students, sequential algorithms are likely to be time consuming. The purpose of this work is to present a parallel metaheuristic algorithm for producing good sub-optimal exam timetables in a reasonable time. Empirical results show that our proposed parallel scatter search algorithm yields good speedup. Also, they show that the parallel algorithm improves solution quality in comparison with the sequential algorithm. |
|---|