<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>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.</p>
</abstract>

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.

Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm

International Journal on Smart Sensing and Intelligent Systems

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

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...

Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm

Data publikacji: 01 gru 2016

Zakres stron: 2219 - 2236

Otrzymano: 16 sie 2016

Przyjęty: 14 lis 2016

DOI: https://doi.org/10.21307/ijssis-2017-961

Słowa kluczowe
Shortest path problem, Dijkstra algorithm, Node combination, Transportation problem

© 2016 Bilqis Amaliah et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Finding the Shortest Paths Among Cities in Java Island Using Node Combination Based on Dijkstra Algorithm

Data publikacji: 01 gru 2016

Zakres stron: 2219 - 2236

Otrzymano: 16 sie 2016

Przyjęty: 14 lis 2016

DOI: https://doi.org/10.21307/ijssis-2017-961

Słowa kluczoweShortest path problem, Dijkstra algorithm, Node combination, Transportation problem

© 2016 Bilqis Amaliah et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Słowa kluczowe
Shortest path problem, Dijkstra algorithm, Node combination, Transportation problem