Abstract: The maximum-flow problem of networks is a classical combinational optimization problem，which is an important element of computer science and operations research.Based on the characteristic of ant algorithm，transform the maximum-flow problem of networks correspondingly，and using the ant algorithm to solve.Simulation results show that the algorithm，which can efficiently solve maximum-flow problem of networks in a relatively short time，is effective.

Key words: ant algorithm, maximum flow problem of networks, labeling algorithm, directed network

摘要： 网络最大流问题是一个经典组合优化问题，是计算机科学和运筹学的重要内容。根据蚁群算法的特点，将网络最大流问题进行相应地转化，然后利用蚁群算法进行求解。仿真结果表明，该算法能方便快捷地解决最大流问题，是行之有效的方法。

关键词: 蚁群算法, 网络最大流问题, 标号算法, 有向网络