Formulation of low level heuristics

Abstract

The curricula scheduling is very significant and largely studied problem in academia. The desired solution calculatedly assembles the academic events over the carefully designed layout considering several predefined interlinked constraints. The contemporary research for solving scheduling constraints is inclined to raise the degree of generality, so that a wide range of identical problems may be addressed. The hyper-heuristic is such a state-of-the-art solving technique which stands on multi-layered framework. The top layer usually consists of classic algorithm for managing the operators on down-layers, and the same is occasionally assisted by machine learning or similar techniques. This research article examines the performance of the small group of bespoke low level heuristics. These LLHs are operated by hyper-heuristic to address the specific scheduling constraints. The set of heuristics are divided into a range of subgroups including timescale category which contain two subsets Day and Period. The utility group which contains two patterns named Shift and Swap techniques, while the third category encircles three more subgroups of Random or Sami-Random and Progressive.