158 Abstract—This paper presents an investigation of selection strategies upon the Artificial Bee Colony (ABC) algorithm in examination timetabling problems. ABC is a global stochastic optimisation algorithm that is based on the behavior of honey bee swarms. Onlooker bees in ABC algorithm choose food source based on the proportional selection strategy. In this paper, three selection strategies ...

sure to reduce costs while improving service delivery. A central component to this effort is the availability of timetabling systems that can find practical solutions to maximizing the utilization of teaching resources, such as facilities and staff, while not compromising on education quality. Traditional university timetabling is often concerned with the task of assigning a number of events, s...

The university timetabling, examination and course, are known to be highly constrained optimization problems. Metaheuristic approaches, and their hybrids, have successfully been applied to solve the problems. This paper presents three artificial immune algorithms, the algorithms inspired by the immune system, for university timetabling; clonal selection, immune network and negative selection. T...

Examination timetabling problems are often solved by a two-phase procedure combining a sequential construction heuristic with a metaheuristic improvement search. There can be many combinations of pairing candidate construction heuristics with a metaheuristic. Different pairings are known to produce solutions of varying quality. In this paper we propose a Case Based Reasoning methodology for sel...

Since the mid 1990’s, with the implementation of increasingly flexible modular course structures in many UK Universities, the central production and coordination of the associated examination timetable has become increasingly difficult with more examination offerings having to be timetabled in such a manner as to provide students with a maximum distribution of their exams throughout the examina...

The timetabling problem consists in fixing a sequence of meetings between teachers and students in a prefixed period of time (typically a week), satisfying a set of constraints of various types. [1] Course timetabling is a multidimensional NP-Complete problem. [2] In this paper we present MultiResource Timetabling Problem (MRTP), which is our model for generalized high-school timetabling proble...

Following the success of the First International Timetabling Competition in 2002, the timetabling research community is organising a new competition on this problem (opening August 1st). This new competition will be on three different timetabling problems, and one of the tracks concerns the course timetabling formulation that applies to Italian universities (called Curriculum-based Course Timet...