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 …

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 …

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 …

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 …

Swarm intelligence is a branch of artificial intelligence that focuses on the actions of agents
in self-organized systems. Researchers have proposed a bee colony optimization (BCO) …

Research in the domain of examination timetabling is moving towards developing methods
that generalise well over a range of problems. This is achieved by implementing hyper …

This paper reports on the use of an evolutionary algorithm (EA) to search a space of
heuristic combinations for the uncapacitated examination timetabling problem. The …

Examination timetabling is a discrete, multi-objective and combinatorial optimization
problem which tends to be solved with a cooperation of stochastic search approaches such …

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 …