Abstract
Under the stimulus of national policy vigorously, the higher education obtained the rapid development. Due to the dramatic increase of students, the slow growth of teaching hardware facilities and the shortage of teacher resources, how to make use of limited resources to meet the teaching demand in the optimal form becomes a problem that needed to be solved at present. Schedule arrangement is a process full of conflicts, because there are so many limitations for teaching resources allocation such as the class time of open courses, the classes, class locations and class teachers’ factors such as. In order to improve the efficiency of running school and complete the teaching mission better, it shall use modern information technology in time and space must as far as possible to distribute the teaching resources reasonably. With the aid of optimization theory firstly, this paper establishes a preliminary scheduling optimization model based on the hard constraint conditions to make the needed number for the classroom least as far as possible. Then, we add the soft constraint conditions to the preliminary model and obtain the final optimization model. Finally, this paper adopts the way of comprehensive evaluation, constructs the index system by calculating the classroom utilization, class strength of course object, the dissatisfaction rate of soft constraint conditions, and gets the score standard of curriculum arrangement scheme. For the optimization model of this article, we are using genetic algorithm to solve the results. This paper also gives the calculation steps of genetic algorithm based on course arrangement.
Highlights
Course arrangement is a very important and difficult problem in the teaching process
In 1963, the mathematical model based on course arrangement has already been proposed in C.C.G otlieb’s article, but the model couldn’t practice well in reality because the course arrangement had the vulnerable influence on actual problems
In 1994, Huang Diming and Liu Qiongxin proposed the mathematical model of the university class scheduling problem and the scheduling algorithm, and discussed the design idea of the algorithm
Summary
Course arrangement is a very important and difficult problem in the teaching process. In the 1950s, foreign researches on course arrangement were made. In 1994, Huang Diming and Liu Qiongxin proposed the mathematical model of the university class scheduling problem and the scheduling algorithm, and discussed the design idea of the algorithm. In 1998, Dong Yanyun, Qian Xiaoqun and Zhang Yushu proposed a computer algorithms arrangement based on the analysis of the basic principle and fuzzy principle, the core of which is to calculate RCU and time-classroom slice candidates. In 2007, Liao Yuan was able to solve university course arrangement problems by using a three-dimensional adaptive genetic algorithm, which was not intuitive and the time complexity is higher. In 2009, Wang Feng, Lin Jie made use of the edge coloring theory of graph theory, modeling of arranging resources, and put forward the more effective polynomial time algorithm, making the solution of the problem more reasonable and humanization
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
