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)

Authors

  • Nur Ekawati Putri Universitas Jambi, Jambi, Indonesia
  • Niken Rarasati Universitas Jambi, Jambi, Indonesia

DOI:

https://doi.org/10.38035/ijam.v4i2.1312

Keywords:

Bellman-Ford Algorithm, Fertilizer Distribution, Shortest Path, Weighted Graph

Abstract

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.

References

Alfioza, Y., & Sahputra, E., “Penerapan Metode Algoritma Bellman-Ford Dalam Aplikasi Pencarian Indekos di Kecamatan Gading Cempaka”. Jurnal Innovation Informatics(JII), Vol. 1, No. 3, Hal. 143, Juli 2022.

Darnita, Y., Khairunnisyah, K., & Mubarak, H. (2019). Kompresi Data Teks Dengan Menggunakan Algoritma Sequitur. Sistemasi: Jurnal Sistem Informasi, 8(1), 104-113.

Food and Agriculture Organization of the United Nation. 1985. Manual on Fertilizer Distribution. FAO Fertilizer and Plant Nutrition Bulletin 114p.

Hamdi, S., & Prihandoko, P. (2018). Analisis Algoritma Dijktra dan Algoritma Bellman-Ford Sebagai Penentuan Jalur Terpendek Menuju Lokasi Kebakaran (Studi Kasus: Kecamatan Praya Kota). Energy: Jurnal Ilmiah Ilmu-Ilmu Teknik, 8(1), 26-32.

Harahap, M. K., & Khairina, N. (2017). Pencarian Jalur Terpendek dengan Algoritma Dijkstra. Sinkron: jurnal dan penelitian teknik informatika, 2(1), 18-23.

Homenauth, O. 2013. Fertilizer Manual (Concepts, Aplication, Storage and Handling).National Agricultural Research and Extersion Institute, 32p.

Hutasoit, E. T. H. (2019). Pencarian Rute Terpendek Menggunakan Algoritma Bellman-Ford (Studi Kasus: PT. JNE Medan). Jurnal Sistem Komputer dan Informatika (JSON), 1(1), 20-25.

JANNAH, U. M. (2022). IMPLEMENTASI ALGORITMA DIJKSTRA DAN ALGORITMA ANT COLONY OPTIMIZATION UNTUK MENENTUKAN RUTE DISTRIBUSI PUPUK PADA PT. PUPUK SRIWIDJAJA.

Jola, A. H. (2022). TANDAN BERDURI: PEKERJA PT TIDAR KERINCI AGUNG DI NAGARI TALAO SUNGAI KUNYIT, KABUPATEN SOLOK SELATAN 2007-2018 (Doctoral dissertation, Universitas Andalas).

Munir, R. (2014). Matematika diskrit (Revisi kelima). Informatika.

Nurdiansyah, H. (2012). Implementasi Algoritma Bellman-Ford Untuk Menentukan Lintasan Terpendek Pada Jalur Pengangkutan Kelapa Sawit Di PT. Serikat Putra Lubuk Raja E (Doctoral dissertation, Universitas Islam Negeri Sultan Syarif Kasim Riau).

Pramudita, R., & Safitri, N. (2018). Algoritma Bellman-Ford Untuk Menentukan Jalur Tercepat Dalam Sistem Informasi Geografis. PIKSEL: Penelitian Ilmu Komputer Sistem Embedded and Logic, 6(2), 105-114.

Setiawan, R., Santosa, R. G., & Tampubolon, J. K. (2019). Implementasi Algoritma Bellman-Ford untuk Pencarian Jalur Terpendek Menuju Rumah Sakit di Kota Yogya Berbasis Android. Jurnal Terapan Teknologi Informasi, 3(2), 95-104.

Yesti, S. A. (2022). Implementasi Algoritma Bellman-Ford Dalam Menentukan Lintasan Terpendek Truk Pembuangan Sampah (Doctoral dissertation, Universitas Islam Negeri Sultan Syarif Kasim Riau).

Downloads

Published

2025-09-19

How to Cite

Putri, N. E., & Rarasati , N. (2025). 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). International Journal of Advanced Multidisciplinary, 4(2), 352–364. https://doi.org/10.38035/ijam.v4i2.1312

Issue

Vol. 4 No. 2 (2025): International Journal of Advanced Multidisciplinary (July - September 2025)

Section

Articles

License

Copyright (c) 2025 Nur Ekawati Putri, Niken Rarasati

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors who publish their manuscripts in this journal agree to the following conditions:

  1. The copyright on each article belongs to the author(s).
  2. The author acknowledges that the International Journal of Advanced Multidisciplinary (IJAM) has the right to be the first to publish with a Creative Commons Attribution 4.0 International license (Attribution 4.0 International (CC BY 4.0).
  3. Authors can submit articles separately, arrange for the non-exclusive distribution of manuscripts that have been published in this journal into other versions (e.g., sent to the author's institutional repository, publication into books, etc.), by acknowledging that the manuscript has been published for the first time in the International Journal of Advanced Multidisciplinary (IJAM).