Hyper-heuristics are search methodologies that aim to provide high-quality solutions across
a wide variety of problem domains, rather than developing tailor-made methodologies for …

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 …

In this work we investigate a new graph coloring constructive hyper-heuristic for solving
examination timetabling problems. We utilize the hierarchical hybridizations of four low level …

Designing generic problem solvers that perform well across a diverse set of problems is a
challenging task. In this work, we propose a hyper-heuristic framework to automatically …

Automated examination timetabling has been addressed by a wide variety of methodologies
and techniques over the last ten years or so. Many of the methods in this broad range of …

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

The artificial bee colony (ABC) is a population-based metaheuristic that mimics the foraging
behaviour of honeybees in order to produce high-quality solutions for optimisation problems …

A two phased approach incorporating the extended great deluge technique is detailed in
relation to the Examination Timetabling Problem as described in the 2nd International …

A hybrid self-adaptive bees algorithm is proposed for the examination timetabling problems.
The bees algorithm (BA) is a population-based algorithm inspired by the way that honey …

The paper investigates a partial exam assignment approach for solving the examination
timetabling problem. Current approaches involve scheduling all of the exams into time slots …