Strategies and Application of Improved Ant Colony Algorithm to Solve University Path

Standard ant colony algorithm(ACO) easily leads to premature convergence in solving university path problem.To overcome this shortcoming,improved ACO is proposed.The ACO introduces a certain percentage reverse ant colony and self-balancing strategy to judge whether ACO starts to a local optimum solution.And a modified state transition operator will guide the ant colony transfer to effectively improve the performance and increase the diversity.There use C++ programming of Visual Studio2005.net.The results show that this algorithm can not only effectively solve the university shortest path problem,but also has high convergence precision and overcomes premature convergence effectively.