| 蚁群算法在网络最大流问题中的应用 |
| |
| 引用本文： | 谢民,高利新,管海娃.蚁群算法在网络最大流问题中的应用[J].计算机工程与应用,2008,44(22):113-115. |
| |
| 作者姓名： | 谢民 高利新 管海娃 |
| |
| 作者单位： | 温州大学,运筹与控制研究所,浙江,温州,325000 |
| |
| 基金项目： | 国家自然科学基金
,
浙江省高校中青年学科带头人资助项目 |
| |
| 摘 要： | 网络最大流问题是一个经典组合优化问题,是计算机科学和运筹学的重要内容。根据蚁群算法的特点,将网络最大流问题进行相应地转化,然后利用蚁群算法进行求解。仿真结果表明,该算法能方便快捷地解决最大流问题,是行之有效的方法。
|
| 关 键 词： | 蚁群算法 网络最大流问题 标号算法 有向网络 |
| 收稿时间： | 2007-10-9 |
| 修稿时间： | 2007-12-24
|
Ant algorithm applied in maximum-flow problem of networks |
| |
| 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. |
| |
| Authors: | XIE Min GAO Li-xin GUAN Hai-wa |
| |
| Affiliation: | Institute of Operations Research and Control Science，Wenzhou University，Wenzhou，Zhejiang 325000，China |
| |
| 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. |
| |
| Keywords: | ant algorithm maximum flow problem of networks labeling algorithm directed network |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
