Optimasi Rute Terpendek Jalur Distribusi Pupuk Menggunakan Algoritma Artificial Bee Colony (Studi Kasus: PT Bungo Dani Mandiri Utama

rio Liusman -
Rara Winanda -

Abstract


Product distribution involves planning and storing information related to product storage until the product is delivered. PT Bungo Dani Mandiri Utama is a fertilizer distributor that must visit ten retailers in its product distribution. This research aims to test whether the route currently used by PT Bungo Dani Mandiri Utama is optimal or needs improvement. This research is an applied study that uses the Artificial Bee Colony algorithm to solve the fertilizer distribution problem modeled as a Traveling Salesman Problem. From the analysis, the optimal route is obtained, starting from the warehouse, passing Lubuk Beringin, Limbur, Kerakap Island, Rantau Ikil, Mangun Jayo, Tanjung Menanti, Sungai Binjai, SPA Unit 1 Market, Tirta Mulya, Senamat, and back to the warehouse, with a total distance of 330 km. This optimal route is 48 km shorter than the usual route used by PT Bungo Dani Mandiri Utama which covers 378 km.


Full Text:

PDF

References


Auliasari, K., Kertaningtyas, M., dan Basuki, D. W. (2018). Optimalisasi Rute Distribusi Produk Menggunakan Metode Traveling Salesman Problem. Jurnal Sains, Teknologi dan Industri, 16(1), 15-23.

Rizki, A. M., Mahmudy, W. F., danYuliastuti, G. E. (2017). Optimasi Multi Travelling Salesman Problem (M-TSP) untuk Distribusi Produk pada Home Industri Tekstil dengan Algoritma Genetika. Kumpulan Jurnal Ilmu Komputer (KLIK), 04(02), 125-135.

Utomo, R. G., Maylawati, D. S., danAlam, C. N. (2018). Implementasi Algoritma Cheapest Insertion Heuristic (CIH) dalam Penyelesaian Travelling Salesman Problem (TSP). JOIN (Jurnal Online Informatika, 3(1), 61-67.

Adventia, Agnes. (2018). Penyelesaian Masalah Pendistribusian Barang Menggunakan Algoritma Bee Colony Optimization. Eureka Matika, Vol. 6, No. 2, 64-72.

Karaboga., D., & Basturk, B. (2007). A Powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm. Journal of Global Optimization, 39(3), 459-471.

Furqan, Muhammad dkk. (2022). Penerapan Algoritma Artificial Bee Colony Untuk Optimasi Rute Jalur Terpendek Distribusi Pipa Air Bersih. Journal of Machine Learning and Artificial Intelligence. Vol. 1, No. 2, 125-132.

Chaerunnissa, Hilda., Respitawulan (2021). Penyelesaian Travelling Salesman Problem dengan Menggunakan Algoritma Artificial Bee Colony. Jurnal Riset Matematika, Vol. 1, No.1, 37-45.

Sugiyono. (2013). Metode Penelitian Kuntitatif, Kualitatif, dan R&D. Bandung: Alfabeta

Robandi, Imam. (2019). Artificial Intelligence: Mengupas rekayasa kecerdasan tiruan. Yogyakarta: ANDI.

Jamaluddin, Siti Hafawati, dkk. (2022). Solving the Travelling Salesman Problem by Using Artificial Bee Colony Algorithm. Journal of Computing Research and Innovation (JCRINN). Vol 7 No 2, 121-131.

Gutin, G. dan Punnen, A., (2004). The Travelling Salesman Problem and Its Variations. Dordrecht: Kluwe Academic Publishers.

A Akay, B., & Karaboga, D. (2012). A Modified Artificial Bee Colony Algorithm for Real-Parameter Optimization. Information Sciences (192), 120-142

Daniel B, Paillin and Johan M Tupan. 2018. Pemecahan Travelling Salesman Problem Menggunakan Teknik Branch and Bound Dan Cheapest Insertion Heuristic (Studi Kasus : PT Paris Jaya Mandiri - Ambon).

Gutin, G. dan Punnen, A., (2004). The Travelling Salesman Problem and Its Variations. Dordrecht: Kluwe Academic Publishers.

Rahmalia., D., & Herlambang, T. (2017). Optimasi Masalah Transportasi Distribusi Semen Menggunakan Algoritma Artificial Bee Colony. Multitek Indonesia Jurnal Ilmiah, 11, 105-113.




DOI: http://dx.doi.org/10.24036/unpjomath.v8i4.14973