An Adaptive Tie Breaking and Hybridisation Hyper-Heuristic for Exam Timetabling Problems


Graph colouring heuristics have long been applied successfully to the exam timetabling problem. Despite the success of a few heuristic ordering criteria developed in the literature, the approaches lack the ability to handle the situations where ties occur. In this paper, we investigate the effectiveness of applying tie breakers to orderings used in graph… (More)
DOI: 10.1007/978-3-642-24094-2_15


15 Figures and Tables