The Application of Max-Min Ant System Algorithm on the Maximum Flow Problem

The 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 system algorithm, we transform the maximum flow problem correspondingly, and then we utilize the ant system algorithm to resolve the problem. In this paper we use ant system algorithm to solve the maximum flow problem, and the simulation results show that the ant system 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.