浅析航线选择中的改进最短路径算法  

Cause analysis of improvedalgorithm of shortcut onselecting the favorite line

作　　者：郁振伟[1] 叶清[1] 

机构地区：[1]海军潜艇学院,山东青岛266071

出　　处：《船海工程》2007年第6期86-88,共3页Ship & Ocean Engineering

摘　　要：利用改进的最短路径算法对船舶最佳航线最短路径作出定量描述,阐述Dijkstra算法和改进算法,并通过船舶最佳航线选择示例说明算法的应用,比较表明,改进算法在搜索效率上优于Dijkstra算法。In This paper the problem is dealt quantitatively by using the improved shortcut algorithm. The Dijkstra algorithm and improved algorithm are described in detail. The application of the improved algorithm is also illustrated with an example of selecting Optimum route.. By Comparing Dijkstra algorithm with the im~ proved algorithm,it is found that the latter is better than the former in searching efficiency.

关 键 词：DIJKSTRA算法 改进算法 最佳航线 最短路径 

分 类 号：U692.3[交通运输工程—港口、海岸及近海工程]