Determination of The Shortest Trajectory on The Fertilizer Transportation Line with The Bellman-Ford Algorithm (Case Study: PT. Tidar Kerinci Agung, Kebun Bukit Sembilan (KBS), Afdeling II)

This research focuses on determining the shortest path on a fertilizer transportation route by modeling the distribution network as a weighted graph. The Bellman-Ford algorithm calculates all distances or shortest paths from the starting point to the destination point. The shortest path is the path traversed from one point to another by looking at the smallest edge value. The word shortest in the path problem has the meaning of the process of minimizing the weight on a graph path. This research aims to explore the application of the Bellman-Ford algorithm in determining the shortest path on the fertilizer transportation route because the results will provide the best path connecting the warehouse with the block points where the fertilizer is distributed. The term "fertilizer" in everyday terms refers to a material used to increase soil fertility. In this research, it is hoped that the solution found will have a positive impact and become an example for companies through a better understanding of the application of this algorithm. Based on the results of the iterations that have been carried out, 1 shortest path was obtained on the fertilizer transportation route using the Bellman-Ford algorithm.  To reach the end point (B94a) faster, the fertilizer truck will pass through 11 points, namely e2  > e5  > e9 >  e14  > e15  > e20  > e22  >  e31  >  e33  >  e34  > e35. The calculation is carried out until the 11th iteration with the minimum distance obtained being 6.59 km.