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

university course timetabling problem is a serious challenge for the academic managers in each semester. because of a vast number of constraints and the complexity of relationship among the constraints, the problem is known to be of hard class. in this paper, a decision support system is proposed to assist the decision makers in solving the university course timetabling. the proposed system pro...

The university course timetabling problem is a typical combinatorial optimization problem. This paper tackles the multi-objective university course timetabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previo...

The university course timetabling is known to be a highly constrained optimization problem, more complex than examination timetabling. Many different approaches, including evolutionary algorithms, tabu search, simulated annealing, and their hybrids, are developed for solving the problem. The negative selection algorithm, an algorithm inspired by the immune system, has successfully been applied ...

The university course timetabling problem is hard and time-consuming to solve. Profits from full automatisation of this process can be invaluable. This paper describes architecture and operation of two automatic timetabling systems. Both are based on evolutionary algorithms, with specialised genetic operators and penalty-based evaluation function. The paper covers two problem variations (theore...

There is a perception that teaching space in universities is a rather scarce resource. However, some studies have revealed that in many institutions it is actually chronically under-used. Often, rooms are occupied only half the time, and even when in use they are often only half full. This is usually measured by the “utilisation” which is defined as the percentage of available ’seat-hours’ that...

This paper looks at Memetic Algorithm for solving timetabling problems. We present a new memetic algorithm which consists of global search algorithm and local search algorithm. In the proposed method, a genetic algorithm is chosen for global search algorithm while a simulated annealing algorithm is used for local search algorithm. In particular, we could get an optimal solution through the .NET...

An examination timetabling problem at a large American university is presented. Though there are some important differences, the solution approach is based on the ITC 2007 winning solver which is integrated in the open source university timetabling system UniTime. In this work, nine real world benchmark data sets are made publicly available and the results on four of them are presented in this ...

The modeling and solution approaches being used to automate construction of course timetables at a large university are discussed. A course structure model is presented that allows this complex real-world problem to be described using a classical formulation. The problem is then tackled utilizing a course timetabling solver model that transforms it into a constraint satisfaction and optimizatio...

We report on our progress on building a decision support system for course timetabling. Our goal is to construct course timetables that minimize some measure of total con flict and tend toward producing compact schedules for pro fessors and students. Our initial application is for the Sci ence Division courses at Rollins College, but the results should ultimately lead to a more general timetabl...