Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (22): 113-115.DOI: 10.3778/j.issn.1002-8331.2008.22.034

• 网络、通信、安全 • Previous Articles     Next Articles

Ant algorithm applied in maximum-flow problem of networks

XIE Min,GAO Li-xin,GUAN Hai-wa   

  1. Institute of Operations Research and Control Science,Wenzhou University,Wenzhou,Zhejiang 325000,China
  • Received:2007-10-09 Revised:2007-12-24 Online:2008-07-11 Published:2008-07-11
  • Contact: XIE Min


谢 民,高利新,管海娃   

  1. 温州大学 运筹与控制研究所,浙江 温州 325000
  • 通讯作者: 谢 民

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

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

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