An Improved Genetic Algorithm for Scheduling Problem

NP-hard problemssuch as university course timetabling are very difficult to solve by conventional methods. We know scheduling problem is one of the Nondeterministic Polynomial (NP) problems. In purposed algorithm the problem of university class scheduling is solved through a new chromosome structure and modifying the normal genetic methods and our previous work 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. Finally in the last section 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