Research And Design Of Courses Arrangement Based On Ant Colony Algorithm

This paper firstly discusses the different kinds of principle and requirement of the Curriculum Schedule Problem(CSP). And expresses that the CSP is an combination optimizing problem; then it gets the CSP is a completely NP. To discuss this problem, in this case, we design an ACA to resolve. This algorithm which is used to solve the optimization problem and we get the idea from simulating the way of ants finding the shortest path for food. This algorithm has been applied successfully to combinatorial optimization problems such as the Traveling Salesman Problem (TSP) .Ant Colony Algorithm (ACA) includes three models, but they have the limitation of running into local optimum in ant colony algorithm, in order to stop the process of getting the answer of the arrangement course problem. According to it self s requirement and character, put this three algorithms' characters together, and according to the principle of bigraph, this paper gets an improved algorithm, which is based on adaptively adjusting the increase of the routes' pheromone, according to the solutions that artificial ants have found, is proposed. The method will not easily fall in the local optimum, thus it can expand the search space and increase. The probability of converging at the global optimum. The result of the experiment shows that the improved algorithm can improve the space of getting the answer and the quality of the answer.The algorithm has carried on the achievements in Windows 2000 operating system. The actual developing means is one of the visual programming methods-C#.