Research And Implementation Of Intelligent Course-Arranging Algorithm

Course-Arranging is one of the important works in college academic activities; it is the premise and foundation in ensuring the normal teaching process. Now, manual course-arranging methods is mainly used in most colleges, but with the expansion of college enrollment, there is a serious shortage of teaching resources and the teaching resource utilization is also increasingly being taken seriously, also along with the diversification of school running form and various kinds of requirements in the processing of course-arranging, such as wide range, multi-constraints and so on, the manual course-arranging method becomes unpractically. Therefore, a solution using computer in course-arranging process is been considered. It is a worth studying work in researching how to arranging a reasonable and satisfactory course timetable quickly and efficiently using computer, which attractes a large number of researchers at home and abroad. But it is difficult to develop a course-arranging system according to the real application. So far, there is not yet an automated course-arranging system with good user-reflecting.In this paper, through analyzing the the principles and requirements of course arranging, according to the actual requirements in our school, we build a multi-objective combinatorial programming model and propose an intelligent course-arranging algorithm based on greedy theory. In the model, we take the conflict-free hard conditions as constraints and some rational, adaptive principles as optimization objective and solve it using multi-objective optimization theory. In the course-arranging algorithm proposed in this paper, we find the regularities in course arrangement by analyzing the historical data using total probability formula, which can be applied to the automated course-arranging process to make the result more reasonable. The theory of priority is used and all courses are arranged according to the priority defined by the user or calculated according to certain rules. The algorithm process is divided into two parts:room selection and time selection, in accordance with the theory of greedy algorithm, we calculate the objective function value for each selected room and time, and then take the current optimal solution for course arranging according to the theory of multi-objective optimization. the optimal solution to select the current curriculum.For the "course skipped" problem appeared in the course-arranging process, we present a simple adjustment algorithm without backtracking in this paper. By searching out the task collection which needed to be canceled possibly in order to arrange the skipped course, we cancel the arrangements of some tasks according to the user's decision that means reduce their priority, and then run the automated course-arranging algorithm again for the "course skipped" tasks.This algorithm reduces the number of "course skipped" at the expense of low-goodness course arrangement result, and user's participation avoids the unreasonable course-arranging results, it can solve the "course skipped" problem effectively without backtracking.Finally, we describe the process of intelligent course-arranging algorithm in detail through experiments. It is proved that the course timetable generated by this algorithm is true and can better meet the constraints of courses, teachers, and so on. On this basis, we design and implement a course-arranging system in this paper, and give a detailed analysis and design of the system data-structure, system function and so on.The intelligent course-arranging algorithm and system described in this paper have some degree of theoretical and practical value. The system we designed and implemented provides a good interactive way, and the course timetable generated by the system is reasonably and user satisfaction to a certain extent. At present, the course-arranging algorithm has brought into effect in exam and course arranging process and achieved good result.