2019
DOI: 10.1088/1742-6596/1402/7/077014
|View full text |Cite
|
Sign up to set email alerts
|

Searching the shortest route to distribute disaster’s logistical assistance using Dijkstra method

Abstract: The logistical assistance’s distribution itself has problems in determining the shortest route which should be chosen properly. Dijkstra method can be applied in choosing the shortest route. Dijkstra method is a method that can determine the shortest route from the boarding point to the arrival point by the smallest weight, to display into a map, it needs Google Maps Api technology. It is a free service provided by google that can be accessed by a browser. This research resulted in application on logistical as… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…According to the algorithm, the initial point of the robot could be described as the first node, and the desired point could be described as the last node. Dijkstra's method is a method that can determine the shortest route from the boarding point to the arrival point by the smallest weight (Hartomo et al, 2019).…”
Section: Ekf (Extended Kalman Filter)mentioning
confidence: 99%
“…According to the algorithm, the initial point of the robot could be described as the first node, and the desired point could be described as the last node. Dijkstra's method is a method that can determine the shortest route from the boarding point to the arrival point by the smallest weight (Hartomo et al, 2019).…”
Section: Ekf (Extended Kalman Filter)mentioning
confidence: 99%