Application And Research Of University Curriculum Arrangement Based On Ant Colony Algorithm

Course Scheduling is the management of a college education is very important and very complicated, managing work, and its essence is to make the school under the existing teaching resources for teachers, students, courses in time and space to make reasonable arrangements to enable the Teaching can be a planned and orderly manner. In recent years, with the enrollment of college freshmen stepped up, all colleges and universities are faced with classroom resources and teacher resource constraints problem. Since the data is large in scale, complexity of the various constraints as well as teaching in the implementation process of the dynamic nature makes the Course Scheduling issue has become one of the vexing problems. Artificial Course Scheduling has been difficult to complete the work requirements of colleges and universities timetable scheduling. Therefore, the use of computers by people arranging schedule more and more attention and become an urgent need to solve practical problems.Ant colony algorithm has strong robustness, good distributed computer system, easy to combine with other methods and so on. The current ant colony algorithm for TSP problem has been infiltrated by a single to multiple applications, from static optimization problem to solve one-dimensional developed to solve the multi-dimensional dynamic optimization problem, by the discrete domain within the scope of research gradually expanded to a continuous domain within the scope of research. Although this method of study has just started, but these preliminary studies have shown ant colony optimization algorithm in solving the complex problems of a number of advantages to prove that it is a promising approach.In this paper, the inherent characteristics of Course Scheduling issues present a problem suitable for arranging schedule improved ant colony algorithm. At this point, the issue of arranging schedule of abstraction, will address the course arrangement is transformed into a bipartite graph to find the maximum matching problem, results show that the ant colony algorithm can be a good solution to Course Scheduling problems, discharge of high-quality class schedule.The article also by collecting experimental data on the cases described in the text parameter selection is suggested. This article aims to broaden the Course Scheduling algorithm solution, while promoting the application of ant colony algorithm surface.