最大最小蚁群算法在最大流问题中的应用

he maximum flow problem is one of the classical combinatorial optimization problems. Most of the traditional maximum flow problems are based on “Augmented chain theorem”. According to the characteristics of ant colony algorithm, we transform the maximum flow problem correspondingly, and then we utilize the ant colony algorithm to resolve the problem. In this paper we use the ant colony algorithm to solve the maximum flow problem, and the simulation results show that the ant colony algorithm can be used to resolve the maximum flow problem, and this also provided a new approach to the study on the maximum flow problem.