On the Numerical Method for the Shortest Path Problem

• Main Authors: WU MENG HUA, 吳孟樺
• Other Authors: 莊政義
• Format: Others
• Language: zh-TW
• Published: 2002
• Online Access: http://ndltd.ncl.edu.tw/handle/53950277855457235813

碩士 === 國立海洋大學 === 商船學系碩士班 === 90 === This paper presents an innovative numerical method of the shortest path problem for a network. Firstly, the topological structure of a network is converted into a two-dimensional data structure via Flow-table so that data storage and numerical processing can easily be made. Secondly, by the Echelon form processing, Minimum Span Tree and Tie-set links of the network under studied can be identified. Finally, by taking advantages of a hypothetical path, the shortest path of the network can then be obtained. The proposed method in this paper is also illustrated by a numerical example via MATLAB software. The shortest path for a large network with complex topology can be solved by the proposed method with easy-processing features. The method is applicable to the fields of operations research, transportation management, and computer networking.