A robust simulated annealing based examination timetabling system
Computers and Operations Research
A Survey of Automated Timetabling
Artificial Intelligence Review
Improving Evolutionary Timetabling with Delta Evaluation and Directed Mutation
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Recent Developments in Practical Examination Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
A Memetic Algorithm for University Exam Timetabling
Selected papers from the First International Conference on Practice and Theory of Automated Timetabling
Tabu Search Techniques for Examination Timetabling
PATAT '00 Selected papers from the Third International Conference on Practice and Theory of Automated Timetabling III
Fast Practical Evolutionary Timetabling
Selected Papers from AISB Workshop on Evolutionary Computing
New Algorithms for Examination Timetabling
WAE '00 Proceedings of the 4th International Workshop on Algorithm Engineering
A Campus-Wide University Examination Timetabling Application
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Applying evolutionary computation to the school timetabling problem: The Greek case
Computers and Operations Research
A comprehensive analysis of hyper-heuristics
Intelligent Data Analysis
Hybrid Local Search Techniques for the Generalized Balanced Academic Curriculum Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
A hybrid tabu search algorithm for automatically assigning patients to beds
Artificial Intelligence in Medicine
INFORMS Journal on Computing
Measurability and reproducibility in university timetabling research: discussion and proposals
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Ant algorithms for the exam timetabling problem
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
An experimental study on hyper-heuristics and exam timetabling
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Solving a practical examination timetabling problem: a case study
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
The university course timetabling problem with a three-phase approach
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
A novel similarity measure for heuristic selection in examination timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
PATAT'04 Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling
Local search techniques for large high school timetabling problems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Many researchers studying examination timetabling problems focus on either benchmark problems or problems from practice encountered in their institutions. Hyperheuristics are proposed as generic optimisation methods which explore the search space of heuristics rather than direct solutions. In the present study, the performance of tournament-based hyperheuristics for the exam timetabling problem are investigated. The target instances include both the Toronto and ITC 2007 benchmarks and the examination timetabling problem at KAHO Sint-Lieven (Ghent, Belgium). The Toronto and ITC 2007 benchmarks are post-enrolment-based examination timetabling problems, whereas the KAHO Sint-Lieven case is a curriculum-based examination timetabling problem. We drastically improve the previous (manually created) solution for the KAHO Sint-Lieven problem by generating a timetable that satisfies all the hard and soft constraints. We also make improvements on the best known results in the examination timetabling literature for seven out of thirteen instances for the To ronto benchmarks. The results are competitive with those of the finalists of the examination timetabling track of the International Timetabling Competition.