Hyper-heuristics are proposed as a higher level of abstraction as compared to the
metaheuristics. Hyper-heuristic methods deploy a set of simple heuristics and use only non …

This paper presents our work on analysing the high level search within a graph based
hyperheuristic. The graph based hyperheuristic solves the problem at a higher level by …

This paper presents a hybrid hyper-heuristic approach based on estimation distribution
algorithms. The main motivation is to raise the level of generality for search methodologies …

This paper investigates a tabu-search-based hyper-heuristic for solving examination
timetabling problems. The hyper-heuristic framework uses a tabu list to monitor the …

This paper is concerned with the hybridization of two graph coloring heuristics (Saturation
Degree and Largest Degree), and their application within a hyper-heuristic for exam …

Over the years, many variants, extensions and adaptations of local search techniques have
appeared in the literature. Some of them have become extremely famous, such as Simulated …

Combinatorial optimisation algorithms can be both slow and fragile. That is, the quality of
results produced can vary considerably with the problem and with the parameters chosen …

Research in the field of examination timetabling has developed in two directions. The first
looks at applying various methodologies to induce examination timetables. The second …

The most common approach to multiobjective examination timetabling is the weighted sum
aggregation of all criteria into one cost function and application of some single-objective …

Many researchers studying examination timetabling problems focus on either benchmark
problems or problems from practice encountered in their institutions. Hyperheuristics are …