计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (22): 113-115.DOI: 10.3778/j.issn.1002-8331.2008.22.034
• 网络、通信、安全 • 上一篇 下一篇
谢 民,高利新,管海娃
收稿日期:
修回日期:
出版日期:
发布日期:
通讯作者:
XIE Min,GAO Li-xin,GUAN Hai-wa
Received:
Revised:
Online:
Published:
Contact:
摘要： 网络最大流问题是一个经典组合优化问题，是计算机科学和运筹学的重要内容。根据蚁群算法的特点，将网络最大流问题进行相应地转化，然后利用蚁群算法进行求解。仿真结果表明，该算法能方便快捷地解决最大流问题，是行之有效的方法。
关键词: 蚁群算法, 网络最大流问题, 标号算法, 有向网络
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
谢 民,高利新,管海娃. 蚁群算法在网络最大流问题中的应用[J]. 计算机工程与应用, 2008, 44(22): 113-115.
XIE Min,GAO Li-xin,GUAN Hai-wa. Ant algorithm applied in maximum-flow problem of networks[J]. Computer Engineering and Applications, 2008, 44(22): 113-115.
0 / 推荐
导出引用管理器 EndNote|Ris|BibTeX
链接本文: http://cea.ceaj.org/CN/10.3778/j.issn.1002-8331.2008.22.034
http://cea.ceaj.org/CN/Y2008/V44/I22/113
