A Fast Genetic Algorithm for Solving University Scheduling Problem

Mortaza Abbaszadeh, Saeed Saeedvand


University course timetabling is a NP-hard problem which is very difficult to solve by conventional methods, we know scheduling problem is one of the Nondeterministic Polynomial (NP) problems. This means, solving NP problems through normal algorithm is a time-consuming process (it takes days or months with available equipment) which makes it impossible to be solved through a normal algorithm like this. In purposed algorithm the problem of university class scheduling is solved through a new chromosome structure and modifying the normal genetic methods which really improves the solution in this case. We include lecturer, class and course information in presented algorithm, with all their Constraints, and it creates optimized scheduling table for weekly program of university after creating primary population of chromosomes and running genetic operators. In the final part of this paper we conclude from the results of input data analysis that the results have high efficiency compared with other algorithms considering maximum Constraints.


Genetic Algorithm, Chromosome, Population, Fitness, Mutation

Full Text:


DOI: http://doi.org/10.11591/ijai.v3.i1.pp7-15


  • There are currently no refbacks.

View IJAI Stats

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.