Research And Design Of The Course Arrangement Algorithm

A timetable that satisfies all kinds of constraints and fully considers all kinds of reasonable needs of teachers and students is the premise to ensure the smooth development of school teaching activities.With the implementation of the new college entrance examination reform,it is the general trend to carry out the teaching mode of "class-selection system of stratified teaching"(CSSST)in senior high school.Compared with the traditional teaching mode,CSSST requires the realization of teaching objectives such as stratified teaching and classified guidance,which greatly improves the difficulty of school course scheduling and significantly increases the workload of course scheduling.Accordingly,scheduling a reasonable timetable in accordance with CSSST is beyond the capabilities of the traditional manual method.Domestic research on the scheduling algorithm under CSSST has just started,and a mature and efficient scheduling algorithm has not yet formed.Therefore,on the basis of the achievements in timetabling scheduling algorithm research at home and abroad,by analyzing the actual needs of teachers and students on the timetable under CSSST,as well as the constraints between various teaching resources,this dissertation puts forward the model of timetable scheduling under CSSST,and designs a multi-stage heuristic algorithm to solve the problem.The major contributions of this dissertation are outlined as follows:1.This dissertation summarizes the research status and main research contents of the scheduling problem under CSSST,gives the general mathematical model of the combinatorial optimization problem,and briefly introduces several common algorithm frameworks for solving combinatorial optimization problems with NP difficulty.2.The timetable scheduling problem under CSSST is divided into two sub-problems:class scheduling and class scheduling.The constraints and restriction of teaching resources in these two sub-problems are analyzed.On this basis,the mathematical models of class scheduling and class scheduling are proposed,respectively.3.A multi-stage heuristic algorithm is designed to solve the timetable scheduling problem.The algorithm includes five stages:determining the combination of elective subjects for administrative classes,optimizing the results of class assignments,determining the plan of classes,resolving teachers' conflicts and optimizing the results of class scheduling.Taking the data of teachers and students in a middle school in Zhejiang Province in May 2018 and the corresponding results of course selection as experimental examples,the algorithm designed in this dissertation is used to calculate is implemented and the results of class division and course scheduling are obtained.Compared with the real timetable used in this middle school,the feasibility and validity of the proposed algorithm are verified.4.The summary of the whole dissertation is given.The limitations of the study are pointed out,and the directions of following research in future are prospected.The research in this dissertation shows that through the scientific and intensive allocation of various teaching resources and the design of targeted strategies,an efficient scheduling algorithm can be obtained.The results of this dissertation can not only enrich the solution to the timetable scheduling problem,but also probably be developed into an efficient and universal software to solve the timetable scheduling problem in senior high schools under CSSST,which is of great significance to the implementation of the reform of the new college entrance examination.