Study On Timetable Problem Of College Based On Genetic Algorithms

Timetable Problem which is proved NP-completed is a multi-objective combination optimization problem with constraints.Genetic Algorithm Based on the biological mechanism of natural selection and heredity and leveraging colony searching technology, is particularly applicable for the resolution of complicated non-linear problems intractable with traditional searching methods. For nearly 40 years' development, Genetic Algorithm has made great achievements in both theory research and practical applications. This thesis is aimed at solving timetable problem using GA. Firstly, factors, restrictions, objective and difficulty attached to Timetable Problem are discussed and Timetable Problem by mathematic model. Secondly, the quantitative analysis on fuzzy objective is given out and the objective optimization space of timetable problem is established. Furthermore, chromosome coding and heredity operator designing are studied aimed at Timetable Problem, and a fitness function computing method is proposed base on multi objective concordance.Finally, experiment is carried out for timetable problem, and the results show that the algorithm is steady and optimize-ward, the solution is satisfied.