| A Shortest-path Routing Based on Ant Algorithm |
| |
| 作者姓名： | Lianying Min Jinyong Yang |
| |
| 作者单位： | [1]School of Computer Science and Technology, Wuhan University of Technology, Wuhan 430063,China; [2]Wuhan Research Institute of Post and Communication, Wuhan 430074, China |
| |
| 摘 要： |
|
A Shortest-path Routing Based on Ant Algorithm |
| |
| Lianying Min Jinyong Yang.A Shortest-path Routing Based on Ant Algorithm[J].Journal of Communication and Computer,2005,2(9):67-69,74. |
| |
| Abstract: | In this paper, we first analyze the theory of ant algorithm and its mathematic model, and then we put forward a novel approach to solve the shortest-path routing problem with the ant algorithm. Finally we set up an experiment to testify the validity and efficiency of our approach. |
| |
| Keywords: | Ant Algorithm The Shortest-path Routing |
| 本文献已被 维普 等数据库收录！ |
