|International Journal of Applied Information Systems|
|Foundation of Computer Science (FCS), NY, USA|
|Volume 11 - Number 3|
|Year of Publication: 2016|
|Authors: Sanjay R. Sutar, Rajan S. Bichkar|
Sanjay R. Sutar, Rajan S. Bichkar . An Application of Genetic Algorithm for University Course Timetabling Problem. International Journal of Applied Information Systems. 11, 3 ( Aug 2016), 26-30. DOI=10.5120/ijais2016451590
Timetabling problem is a process of assigning given set of events and resources to the limited space and time under hard constraints which are rigidly enforced and soft constraints which are satisfied as nearly as possible. As a kind of timetabling problems, University course timetabling is a very important administrative activity for a wide variety of institutes. Genetic algorithm is an advanced heuristics method which is very effective in many areas. It is frequently deployed meta-heuristics algorithm to solve difficult combinatorial optimization problems. In this paper, genetic algorithm is used to solve university course timetabling problem. At first, a model of problem to be solved is defined. Then, the genetic representation is determined and a fitness function is established according to the constraints. Finally, a case of university course timetabling from real-world is discussed and solved. It is demonstrated that the method proposed in this paper is feasible and efficient.