Applied Research Of Adaptive Genetic Algorithm In The UTP

UTP is the university timetable problem. It is proved that UTP belongs to the NP-hard problems. There are many algorithms to solve UTP problems, such as integer programming, and so on. However, these algorithm optimization effection to large-scale complicated system is not nice.The thesis has absorbed the various characteristics of course arrangement methods in recent years, it is discussed a union solution composed of many methods. This combined method is the combination of adaptive algorithm, genetic algorithms and application of hierarchical thinking. Main content of thesis: 1. Adaptive genetic algorithm (AGA) has applied in the thesis. AGA has carried out certainly adjustment and improvement on probability alternating and mutant probability in simple genetic algorithm mainly. Such can avoid a series of problem such as not mature convergence etc. appearing on simple genetic algorithm better. 2. Use of hierarchical thinking reduced the solution space. 3. Binary-coded genetic algorithm schema theorem will be expanded to the scope of limited integer, alphanumeric codes, or their mixed-coded genetic algorithm. 4. It proposes the Lock markings idea.The experiment is indicated that the arranging timetable theory in this thesis is of some positive significance to the development of universal practical timetable problem.