In some urban transportation companies driving periods are short when compared with the total duty time, leading to long non-driving periods that can be used as cover time. This paper presents the Crew Timetabling Problem, an extension of the Crew Scheduling Problem in which crew timetables are obtained by levelling the cover crew resources. An objective function for this problem is proposed in...

University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...

Two ant algorithms solving a simplified version of a typical university course timetabling problem are presented – Ant Colony System and MAX -MIN Ant System. The algorithms are tested over a set of instances from three classes of the problem. Results are compared with recent results obtained with several metaheuristics using the same local search routine (or neighborhood definition), and a refe...

Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints, however, may be violated, but should be satisfied as much as possible. This paper shows how to model our timetabling problem as a partial constraint satisfaction problem and ...

Timetabling the courses offered at the Computer Science Department of the University of Munich requires the processing of hard and soft constraints. Hard constraints are conditions that must be satisfied, soft constraints, however, may be violated, but should be satisfied as much as possible. This paper shows how to model our timetabling problem as a partial constraint satisfaction problem and ...

This paper describes a case study on a generalpurpose Constraint Relaxation Problem solver, COASTOOL. Using COASTOOL,~ problem can be solved merely by declaring “what is the problem,” without programming “how to solve it.” The problem is solved by a novel method that generates a high-quality initial assignment using arc-consistency, and refines it using hillclimbing. This approach has been eval...

Arranging a lecture/tutorial/lab timetable in a large university department or school is a hard problem faced continually in educational establishments. We describe how this problem has been solved in one institution via the use of evolutionary algorithms. The technique extends easily and straightforwardly to any lecture timetabling problem. Although there may be more eeective ways to handle pa...

This work presents a constructive approach to the process of fixing a sequence of meetings between teachers and students in a prefixed period of time, satisfying a set of constraints of various types, known as school timetabling problem. The problem is modeled as a bi-objective problem used as a basis to construct feasible assignments of teachers to classes on specified timeslots. A new represe...

Timetabling problems are often hard and time­consuming to solve. Most of the methods of solving them concern only one problem instance or class. This paper describes a universal method for solving large, highly constrained timetabling problems from different domains. The solution is based on evolutionary algorithm’s framework and employs tabu search to speed up the solution finding...

Ametaheuristic-based algorithm is presented for the post enrolment-based course timetabling problem used in track-2 of the Second International Timetabling Competition (ITC2007). The featured algorithm operates in three distinct stages – a constructive phase followed by two separate phases of simulated annealing – and is time dependent, due to the fact that various run-time parameters are calcu...