Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three a...
Saved in:
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Published: |
2023
|
| Subjects: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper tackles university course timetabling problems (UCTP) to find a (near) optimal solution (timetable) while satisfying hard constraints (essential requirements) and minimizing as much as possible the violations of the soft constrains (desirable requirements). In this study, we apply three algorithms, that is, Great Deluge, Simulated Annealing and Hill Climbing where the Round Robin algorithm is used as control strategy in choosing the algorithm to be employed at the current stage. The performance of the approach is tested with over two sets of benchmark datasets, that is, enrolment-based course timetabling and curriculum-based course timetabling (UD1) in comparison with a set of state-of-the-art methods from the literature. The experimental results show that the proposed approach is able to produce competitive results for the test UCTPs. � 2011 Academic Journals. |
|---|