Implementasi Metode Djikstra Dalam Menentukan Jarak Terpendek Pada Pendistribusian Barang Pt. Akur Makmur

Abstract

PT. Akur Makmur needs the shortest distance solution for the process of distributing goods from the Central Warehouse distribution to branches that need in the City quickly, this solution is needed to avoid congestion and speed in distributing goods, and djikstra in accordance with one of the methods used to renew the shortest path so that the goods arrive on time. PT. Akur Makmur can minimize the costs and time needed to distribute goods. The problems in this study are (1) How does PT. Make graphs in the form of graphs (2) How PT. Accurately determine the shortest distance using the djikstra method (3) Determine the costs that can be resolved if using the calculation results with the djikstra method. In this study, taking real data in the field, then measuring the distance and time to use Google Maps facilities, then measuring the shortest distance using the djikstra algorithm, then compiling the route of the data obtained and looking for the shortest path using the Djikstra Algorithm. Based on the results of this study, it can be concluded (1) determining the trajectory in the form of a graphical algorithm (3) comparing the weight of each trajectory distance traversed in the distribution of goods (3) determining the shortest route to be used in the distribution of goods. Advice can be given to PT. Akur Makmur is as a comparison and alternative to the shortest path choice in the distribution of goods.