Implementasi Algoritma Dijkstra Penentuan Rute Terdekat Untuk Pengiriman Barang Berbasis Android

Courier services are a service that facilitates the delivery of various types of goods between locations with security guaranteed by the service provider. Goods delivery encompasses logistics, products, and documents. The growth of the courier service industry, reflected in the increasing trust of the public, demonstrates the importance of timely delivery in the business. Timeliness is a key factor in the courier business, however, couriers often face difficulties in locating recipients and experience delays due to difficulties in finding the nearest routes. Therefore, finding the nearest route is crucial to expedite delivery. The Dijkstra Algorithm is one method used to find the nearest route by calculating the shortest distance between two points in a graph, by calculating the optimal path. Calculation results using the Dijkstra Algorithm indicate that the shortest route is A-F-G-H-I-J-B-C-D-E-K-L-M-N-O with a path length of 11039 meters. Black-Box testing on Android-based applications shows a testing rate of 100%, validating the accuracy of the application in determining routes with precise results. Keywords: Shipping, Nearest Route, Dijkstra Algorithm