Geographical Information System Shortes Path Delivery Of Goods Using The Bellman-Ford And Dijkstra Algorithm (Case Study J&T Palu City)

The demand for goods delivery services (expedition services) is currently growing very rapidly to support the many e-commerce companies that have sprung up in Indonesia. In the delivery process, there is often a delay in delivery due to the random delivery path of the delivery service courier. The development of information technology, especially computer technology, can be used to solve problems in various fields of work. This study aims to optimize the determination of Goods Delivery routes using the Bellman-Ford and Dijkstra Algorithms. The case study was conducted at JT Goods Delivery Services in Palu City, Central Sulawesi. The data used in this study is the distance data between the delivery location points of goods taken from Google Maps. This research was conducted by collecting data on the distance between the source point and the location of the delivery of goods. By using the Bellman-Ford and Dijkstra Algorithms, the Bellman-Ford Algorithm is used to handle graphs with negative weights and detect negative cycles, while the Dijkstra Algorithm is more efficient on graphs with positive weights, focusing on finding the shortest path from one point to all other points, the distance and time required for shipping goods can be minimized so that the efficiency of shipping goods can be increased