Please use this identifier to cite or link to this item:
|Title:||A memetic algorithm for the university course timetabling problem|
|Citation:||20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), Dayton, OH, 1: 427 - 433, 03-05 Nov 2008|
|Abstract:||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.|
|Description:||This article is posted here with permission from IEEE - Copyright @ 2008 IEEE|
|Appears in Collections:||Publications|
Dept of Computer Science Research Papers
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.