Study On Timetable Problem Based On Genetic Algorithms

Timetabling Problem (TTP) is a Multi-objective Combination Optimization Problem with constraints, and also has been proved as a NP-Completed problem; Genetic Algorithm (GA) is a high-effective paralleling processing, randomly searching and self-applicable algorithm based on the development of the nature evolution and option. Due to its strength, it is particularly applicable to operate the traditional searching algorithm and tackle the complicated nonlinear problem.The article applies the GA to the class timetabling. The determinant factors, limited conditions, the solving objectives and uncertainty of the combination have been discussed to set up the mathematical module; secondly the timetable has been divided into the arrangement of time and classroom according to the characteristics of the problem of class arrangement.Timetabling is being processed in two steps, the first is to arrange the time for singular course (solo-objective) and find out several most optimal solutions, the second is to arrange the time for all the courses (multi-objectives) and find out the sequences of all the courses. On the basis of timetable, the classrooms will be organized and the adjustment approach of dating-back will be proposed to solve the problem of chaotic class arrangement.The module discussed in the article is an effective application of solving the problem of arranging the class. As the more focuses being devoted to the problem, the GA is believed to a better approach.