| 一类网络最优路径的双向模拟扩散算法 |
| |
| 引用本文： | 温林,戴明强,李岩.一类网络最优路径的双向模拟扩散算法[J].运筹与管理,2007,16(6):90-93. |
| |
| 作者姓名： | 温林 戴明强 李岩 |
| |
| 作者单位： | 海军工程大学理学院,湖北武汉,430033 |
| |
| 摘 要： | 基于模拟扩散算法的基本原理,文中提出了一种双向寻求网络最优路径的扩散算法,并介绍了该算法原理和具体计算过程,验证了该算法的正确性和合理性。该算法具有并行计算的能力,适合于分布式计算机,寻求大型复杂网络的最优路径。
|
| 关 键 词： | 运筹学 网络优化 双向模拟扩散算法 最优路径 |
| 文章编号： | 1007-3221（2007）06-0090-04 |
| 收稿时间： | 2007-08-02 |
| 修稿时间： | 2007年8月2日 |
A Bilateral Algorithm Based on Simulation of Dispersion for the Shortest-Path Problem |
| |
| WEN Lin,DAI Ming-qiang,LI Yan.A Bilateral Algorithm Based on Simulation of Dispersion for the Shortest-Path Problem[J].Operations Research and Management Science,2007,16(6):90-93. |
| |
| Authors: | WEN Lin DAI Ming-qiang LI Yan |
| |
| Abstract: | Based on basic principle of simulation of dispersion algorithm,this article discusses a method of bilaterally searching for a shortest path in the network,introduces the tenet and the specific calculation process,and verifies the exactness and rationality of the algorithm.This algorithm has the ability of parallel calculating,and is fit for searching for the shortest path of the giant and complicated network by using distributed computers. |
| |
| Keywords: | operations research network optimize bilateral dispersion algorithm shortest path |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
