Research On Timetabling Based On Optimized Heuristic Algorithm

The constraint problem is a tool to solve the constraint problems from many fields.It's main advantage is to use the relationship between variables to accurately describe the constraints,it based on a strong theoretical basis,through evaluation,modeling and optimization to solve a wide range of practical application areas.A time-tabling problem is a typical example of a constraint problem.By satisfying various constraints,it can arrange events to a specific space and time.A typical constraint is that multiple events use the same resources(such as teachers,teaching equipment,etc.),but these resources cannot be used by different events at the same time,or a resource can be used by specific events at the same time.Because of the large practical value of the problem and the representativeness of the problem model,many scholars have been researched and analyzed.This kind of problem is a NP-complete problem,that is,the complexity of some problems in NP is related to the complexity of the entire class.If any of these problems exist for polynomial-time algorithms,then all NP problems are polynomially time-solvable.The time scheduling problem has its own inherent mathematical model,that is,the problem has a solution and can find a solution.The NP-complete problem means that it can be solved by a finite number of calculations.However,as the scale of the problem increases,the amount of calculation increases with the exponential scale.Therefore,the time scheduling problem can only find approximate optimal solutions through some exploration algorithms.As the country attaches more and more importance to education,more and more resources have been devoted to it.Domestically,whether it is basic education,vocational education or higher education,the requirements for teaching quality have become higher and higher,and teachers and students are also in need of individualized timetables.more and more.In particular,now the state has begun to implement the college entrance examination reform for basic education,and requires six or three or three or seven to three elections.The scale of arranging classes after the increase in enrollment in higher education has risen.Under such a background that needs to reflect the individualization of education and the scale is significantly improved,how to carry out individuality? The efficient and effective scheduling of classes is a difficult task for educators.At present,many algorithms for studying course scheduling are mainly based on graph-based ergodic algorithms,greedy algorithms,backtracking methods,and probability-based stochastic algorithms.Algorithms used to solve NP-complete problems are applied to class scheduling problems,achieving certain results,but with With the increasing demand for personalization and the increase in the number of classes,it is increasingly difficult for these algorithms to meet actual needs.Iterative forward search algorithm is a new heuristic algorithm proposed in recent years.It has been widely used in foreign university courses,but there are few domestic related researches.Based on a detailed analysis of this advanced algorithm,this paper proposes an adaptation to domestic universities.The main work is as follows:1 The main constraints,influencing factors,and related algorithms in the course scheduling problem were discussed,and the mathematical model corresponding to the course scheduling problem was described in detail.The theoretical knowledge,mathematical model and design idea of iterative forward search algorithm are studied.2 Combining with the actual situation of domestic universities,a constraintimproving iterative forward search algorithm based on arc-compatible maintenance is proposed,which not only solves the increasingly frequent cross-campus teacher scheduling problems in China,but also provides teachers with individual requirements for teaching time.Problems,while improving the performance of the algorithm in the face of large-scale courses.3 With the constrained logic programming as the guiding ideology,the basic architecture of the improved iterative forward search algorithm was designed and implemented.