改进最短路径算法在最佳航线选择中的应用  

The Improved Shortcut Algorithm and It's Application in Selecting Ship's Optimum Route

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

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

出　　处：《中国航海》2003年第2期15-17,共3页Navigation of China

摘　　要：最佳航线选择不仅是船舶驾驶员经常关注的问题之一 ,而且还是船舶经营公司时常面临的重要问题之一。现利用改进的最短路径算法对该问题作出定量描述。较详细地阐述了Dijkstra算法和改进算法 ,并通过最佳航线选择示例说明了算法的应用。通过比较 ,改进算法在搜索效率上优于Dijkstra算法。The Selection of ship's best favorite route is not only the problem that captains usually pay attention to, but also the important problem that ship keepers often face to. 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 improved algorithm, it is found that the latter is better than the former in searching efficiency.

关 键 词：最佳航线选择 改进最短路径算法 DIJKSTRA算法 船舶航行 航海技术 模型化 

分 类 号：U675.1[交通运输工程—船舶及航道工程]