Algoritma Dijkstra dan Algoritma Greedy Untuk Optimasi Rute Pengiriman Barang Pada Kantor Pos Gorontalo

Delivery of goods is one the services used in online buying and selling process at Post Office company. Companies need a performance distribution that more time-consuming cost-efficient, so it requires determination selecting shortest path. Many algorithms have been to help find path for distributing goods, including Dijkstra Algorithm Greedy Algorithm. In this study, application two routes between sub-districts are destination delivery, then compare see which algorithm optimal. Based on calculation results, can provide optimal solution with total mileage obtained 304.90 Km, while produces distance 441.60 Km.