The university course timetabling problem is an over-constrained optimisation problem that consists in scheduling a set of events in a given number of rooms and timeslots. In a previous work a general case of the problem was considered and an effective hybrid algorithm based on local search optimisation was developed to solve it. Landscape analysis is the new trend to explain local improvements...

Timetabling problems often consists from various requirements which can not be satisfied together [11]. Unsatisfiable requirements can be handled within optimization criteria as soft constraints. Such soft constraints may not be satisfied if there are some contradictions. The remaining hard constraints must be still satisfied. The set of hard and soft constraints can be naturally expressed usin...

Timetabling tasks form a widely studied type of resource scheduling problem, with important real-world applications in schools, universities and other educational settings. In this work, we focus on postenrollment course timetabling, the problem that was covered by Track 2 of the recent 2nd International Timetabling Competition (ITC2007). Following an approach that makes strong use of automated...

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...

The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required t...

Many real-life problems are dynamic, with changes in the problem definition occurring after a solution to the initial formulation has been reached. The minimal perturbation problem incorporates these changes, along with the initial solution, as a new problem whose solution must be as close as possible to the solution of an initial problem. A new iterative forward search algorithm is proposed to...

Timetabling problems are well known complicated constraint satisfaction problems. A new realworld course timetabling problem is described in this study. The difficulty in approximating to an optimal solution in a reasonable time increases for the large problem instances regardless of the algorithm used. An incremental strategy that aims to relieve this difficulty to some extent combined with a ...

A concept of agent-based approach to timetabling problem is presented. Based on the problem description and with its formalization the term “agent” is introduced. Agents act on behalf of entities taking part in the timetabling process (activities, rooms and students) and they interact to maximize their own utility. Also a brief overview of existing approaches is presented. 1. University Timetab...

University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we no...