Hyper-heuristics is a fairly recent technique that aims at effectively solving various real-world
optimization problems. This is the first book on hyper-heuristics, and aims to bring together …

This paper presents an investigation of a simple generic hyper-heuristic approach upon a
set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within …

Examination timetabling is one of the most important administrative activities that takes place
in all academic institutions. In this paper, we present a critical discussion of the research on …

The timetabling problems is the most prominent problem in combinatorial optimization.
University Examination Timetabling Problem (UETP) is considered as one of the common …

In this paper, we investigate variable neighbourhood search (VNS) approaches for the
university examination timetabling problem. In addition to a basic VNS method, we introduce …

Hyper-heuristics can be identified as methodologies that search the space generated by a
finite set of low level heuristics for solving search problems. An iterative hyper-heuristic …

A significant body of recent literature has explored various research directions in hyper-
heuristics (which can be thought as heuristics to choose heuristics). In this paper, we extend …

This paper presents the results of a study conducted to investigate the use of genetic
algorithms (GAs) as a means of inducing solutions to the examination timetabling problem …

Scheduling exams at universities can be formulated as a combinatorial optimization
problem. Basically one has to schedule a certain number of exams in a given number of time …

The study of the relationship and interaction between the work carried out in the academic
literature and the requirements of university administrators is essential if ideas generated by …