A Memetic Algorithm for the University Course Timetabling Problem

The design of course timetables for academic institutions is a very hectic job due to the exponential number of possible feasible timetables with respect to the problem size. This process involves lots of constraints that must be respected and a huge search space to be explored, even if the size of the problem input is not significantly large. On the other hand, the problem itself does not have a widely approved definition, since different institutions face different variations of the problem. This paper presents a memetic algorithm that integrates two local search methods into the genetic algorithm for solving the university course timetabling problem (UCTP). These two local search methods use their exploitive search ability to improve the explorative search ability of genetic algorithms. The experimental results indicate that the proposed memetic algorithm is efficient for solving the UCTP.