Research On Timetable Problem Of College Based On Genetic Algorithms

Arranging course structure is essential in academic administration of university , likewise it is a complicated management task. In recent years, due to the development of the higher education career, the numbers of the students is getting increasing, the arrangement task of course structure is getting heavier under the limitation of classroom resources, meanwhile, course arrangement becomes the key of the task of the education administration function, influencing student cultivation and enhancement of education quality on a certain level and state.Timetabling Problem (TP) is a Multiobjective Combination OptimizationProblem with constraints, and also has been proved NP-Completed.Genetic Algorithm (GA) is a high-effective randomly searching algorithm, based on the nature evolution. It is a very effective algorithm to resolveNP-Completed Combination Optimization Problem. The paper is aimed atsolving timetabling problem using GA. The main content are as following:1 .We systematically and completely discuss factors, restrictions, objectiveand difficulty attached to TP, describes TP by mathematic model, and bringforward the whole frame of the methods.2 .Giving out quantitative analysis of some objective of inkling, we establish objective optimization space of TP.3.We study chromosome coding and heredity operator designing aimed at TP, then introduce the multiobjective decision-making concordance model, put forward a fitness computation mode base on multiobjective concordance decision-making model and improve the generalized structure of GA, uses immune mutation operator to keep the diversity of population, form a coordinated multiobjective optimization algorithm of TP.