期刊名称：International Journal on Smart Sensing and Intelligent Systems
印刷版ISSN：1178-5608
出版年度：2016
卷号：9
期号：4
页码：2219-2236
出版社：Massey University
摘要：This study focuses on finding the shortest paths among cities in Java Island by repeatedlycombining the start node’s nearest neighbor to implement Dijkstra algorithm. Node combination isused to find the shortest path among cities in Java by deleting the node nearest to the start node. Theuse of memory by node combination is more efficient than the use of memory by the original Disjkstraalgorithm. The 46 cities in Java Island will be used to evaluate the performance of finding shortestpath. The experimental results show that the accuracy of node combination is 92.88% with the GoogleMap as the reference. The successful implementation of algorithm in finding the shortest path on thereal problem is a good point; therefore, the algorithm can be developed to solve the transportationnetwork problem.
关键词：Shortest path problem; Dijkstra algorithm; Node combination; Transportation problem
