一类网络最优路径的双向模拟扩散算法  

A Bilateral Algorithm Based on Simulation of Dispersion for the Shortest-Path Problem

作　　者：温林[1] 戴明强[1] 李岩[1] 

机构地区：[1]海军工程大学理学院,湖北武汉430033

出　　处：《运筹与管理》2007年第6期90-93,共4页Operations Research and Management Science

摘　　要：基于模拟扩散算法的基本原理,文中提出了一种双向寻求网络最优路径的扩散算法,并介绍了该算法原理和具体计算过程,验证了该算法的正确性和合理性。该算法具有并行计算的能力,适合于分布式计算机,寻求大型复杂网络的最优路径。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.

关 键 词：运筹学 网络优化 双向模拟扩散算法 最优路径 

分 类 号：O157.5[理学—数学]