Analysis of College Course Scheduling Problem Based on Ant Colony Algorithm

Ant colony algorithm is a new evolutionary algorithm, which is gradually applied due to its easy robustness with other methods and excellent distributed computing mechanism. Currently, the application field of ant colony algorithm has been infiltrated by a single TSP problem. Ant colony algorithm moves the algorithm toward the optimal solution through the combination of positive feedback and negative feedback. This paper briefly analyzes the basic characteristics of the basic idea and principle of the ant colony algorithm to apply it to the ant colony problem. Abstract the course scheduling problem, transform the course arrangement problem into the maximum matching problem of solving the bipartite diagram, and discharge the high-quality curriculum that basically meet the needs.