Some Analysis About Genetic Algorrithm And Its Applications On Timetable Problems

In the timetable problem, we often mainly think the time,teachers,classroon,classes and lessons. A teacher may teaches several lessons, and a lesson is also taught by several teachers. To make a timetable, we must have the teachers fit their lessons, and avoid the conflict of time and space (classrooms) . For making this purpose possible ,we must order the timetable more reasonable so making the lessons of the class and the teachers well designed in time and space (classrooms) , avoiding very focus or very dispersed. So the timetable problem is a multi-object optiraizational problem.There are genetic algorithm,ant colony optimization algorithm,simulated annealing algorithm,artificial neural networks algorithm, etc to solve these optimizational problems. And the genetic algoritm has few steps of translating about the problems ,without special requirements on the problems, its process of solving the problems is more simple than the other algorithms and little depends the problems.This article has told the process of the genetic algorithm, analysing the structure of the hybrid genetic algorithm being made from genetic algorithme and hill-climbing search,deceptive problems, using the method to solving the timetable problem .And we detailedly analyse the restrain conditions and the objective of the timetable problem ,using linear weight sum method to solve the relations among the objectives, then we takes the plan after the weighting result the ultimate objective.