Research On Timetablling Based On Genetic Algorithm

The genetic algorithm is highly parallel, random, adaptive search algorithm. It is based on natural selection and evolutionary mechanism. The scheduling problem is one of the important works in the school. Schedule planning is a multi-objective optimization problem, usually it is based on the past experience, by resolving multiple contradictory objects step-by-step and gets a reasonable timetable. This article uses a genetic algorithm to solve the problem, designs a program to solve this problem.The thesis is focused on the following aspects:researching the problem of school timetable using genetic algorithm to implement the entire process, including representation of chromosome, fitness function design methods, and the various elements of genetic algorithms in the implementation process. This paper proposed an improved method based on the basic genetic algorithm for specific timetabling, including adaptive operator method of crossover and mutation, In conjunction with the algorithm implementation methods, we used VC6.0 as development tools to implement a genetic algorithm for timetable.At last, the whole work of this thesis summarized and the future research direction is also given.