Research Of Courses Arrangement Based On Ant Colony Algorithm

In order to ensure the quality of tuition, a university must establish a set of normal teaching plans, while arranging courses is an important step of carrying out the teaching plan successfully. With the increasing quantity of college students, the scale of data are huge, and all kinds of constraints are complex, courses arrangement becomes more and more difficult in the limited teaching resources. Arranging courses by hand is impossible to finish the work. Therefore, it's urgent to solve the courses arrangement with computer.Ant colony algorithm is a new kind of simulated evolution algorithm which is put forward in near decade years. It seeks the optimal answer from the colony evolution process which includes all possible answers. The process includes adaptation period and collaboration period. In adaptation period, all answers adjust the structure itself according to the accumulated information; in collaboration period, all answers exchange the information to get the better ones. Ant colony algorithm directs the algorithm to the most optimal direction with combination of positive feedback and negative feedback, and keeps the searching range from stopping earlier, in this situation gets the satisfied answer in some degree.This thesis analyzes the thought and the theory of basis colony algorithm, and puts forward an improved ant colony algorithm which is adapted to courses arrangement according to the features itself. This thesis abstracts the courses arrangement problem, and transforms the problem to exploring the biggest match problem of bipartite graph. Because the courses arrangement problem can be described in graph structure in this way ant colony algorithm can solve efficiently. How to satisfy the constraints is the key of courses arrangement, so this thesis brings strategies such as individual enlightenment to this algorithm. This thesis tries to abstract these constraints into some suitable...