FINDING THE SHORTEST PATHS AMONG CITIES IN JAVA ISLAND USING NODE COMBINATION BASED ON DIJKSTRA ALGORITHM

作     者：Amaliah, Bilqis Fatichah, Chastine Riptianingdyah, Olyn 

作者机构：Inst Teknol Sepuluh Nopember Fac Informat Technol Informat Engn Jl Raya ITSGedung Teknik Informat Surabaya 60111 Indonesia 

出 版 物：《International Journal on Smart Sensing and Intelligent Systems》 (Int. J. Smart Sensing Intelligent Syst.)

年 卷 期：2016年第9卷第4期

页      面：2219-2236页

核心收录：

主　　题：Shortest path problem Dijkstra algorithm Node combination Transportation problem 

摘      要：This study focuses on finding the shortest paths among cities in Java Island by repeatedly combining the start node s nearest neighbor to implement Dijkstra algorithm. Node combination is used to find the shortest path among cities in Java by deleting the node nearest to the start node. The use of memory by node combination is more efficient than the use of memory by the original Disjkstra algorithm. The 46 cities in Java Island will be used to evaluate the performance of finding shortest path. The experimental results show that the accuracy of node combination is 92.88% with the Google Map as the reference. The successful implementation of algorithm in finding the shortest path on the real problem is a good point;therefore, the algorithm can be developed to solve the transportation network problem.