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 …

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 …

In this work, we propose a variant of the honey-bee mating optimization algorithm for solving
educational timetabling problems. The honey-bee algorithm is a nature inspired algorithm …

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

Timetabling problem is known as an NP-hard problem that centres around finding an
optimized allocation of subjects onto a finite available number of slots and spaces. It is …

The examination timetabling problem (ETTP) consists in the assignment of specific dates to
the exams of a set of courses assuming that the course enrollments are known. This problem …

This report is based on University Timetable Generator by using Tabu Search algorithm. It
helps to generate a course schedule and an exam schedule for a University. Every …

The prey-predator algorithm is a metaheuristic algorithm inspired by the interaction between
a predator and its prey. Initial solutions are put into three categories: the better performing …

This work presents a simple graph based heuristic that employs a roulette wheel selection
mechanism for solving exam timetabling problems. We arrange exams in non-increasing …