DETERMINING THE OPTIMAL ROUTE OF BULOG RICE DISTRIBUTION USING SEQUENTIAL INSERTION AND NEAREST NEIGHBOUR METHOD

Yayang Safitri, Fibri Rakhmawati, Rima Aprillia

Abstract


Rice consumption in Indonesia is the 4th highest in the world, with an annual average of 35.3 million tonnes. Apart from that, domestic rice production is relatively low, so finding an optimal distribution pattern to meet Indonesia's food consumption needs is necessary. This research aims to find the best route for rice distribution using sequential insertion and nearest-neighbor methods. The aim is to compare the two methods to determine which is suitable for distributing rice. Apart from that, comparisons are made to find the distribution route with the shortest distance and fastest time. The research results show that the optimal travel distance using the sequential insertion method is t = 1, namely 519 Km with a travel time of 779 minutes. Meanwhile, the optimal travel distance using the nearest neighbor method at r = 1 is 506 km with a travel time of 535 minutes. Thus, this problem's nearest neighbor method performs better than sequential insertion.


Full Text:

PDF

References


bulog.co.id. (n.d.). Riwayat Singkat Perusahaan Perum Bulog. Retrieved May 11, 2022, from http://www.bulog.co.id/riwayat-singkat-perusahaan.

Carici, Tonci., & Gold, Hrvoje. (2008). Vehicle Routing Problem (T. Caric & H. Gold, Eds.). InTech.

un, L. C., Rosmanira Ismail, W., Omar, K., & Zirour, M. (2008). Vehicle routing problem: Models and solutions. In Journal of Quality Measurement and Analysis JQMA. vol 4(1), pp. 133-144.

Dahniar, T., Teknik, F., & Pamulang Tangerang Selatan, U. (2020). Distribution Optimization Using Vehicle Routing Problem (VRP) With Nearest Neighbour Salad Product Case Study Approach

Fauzan, Abdurrahman, A., Yanuar Ridwan, A., Santosa, B., & Telekomunikasi Terusan Buah Batu, J. (2019). Penyelesain Vehicle Routing Problem (VRP) dalam Penugasan Kendaraan dan Penentuan Rute untuk Meminimasi Biaya Transportasi pada PT. XYZ dengan Menggunakan Algoritma Genetika. Jurnal Teknik Indusri, 9(1), 16–24.

Hariati, A. (2021). Efektivitas Algoritma Clarke-Wright dan Sequential Insertion dalam Penentuan Rute Pendistribusian Aqua Pada PT Tirta Investama Medan. Universitas Islam Negeri Sumatera Utara.

Jamaludin, M. (2021). Optimizing Rice Distribution Model Using Linear Programming at West Java Bulog. Webology, 18(2), 631–642.

Koswara, H. (2018). Penentuan Rute Distribusi Produk Kaos Pada DOBUJACK INV. Menggunakan Metode Nearest Neighbour Dan (1-0) Insertion Intra Route. Jurnal Rekayasa Sistem & Industri (JRSI), Vol 4(02).pp,147-153.

Munir, R. (2018). Matematika Diskrit (Revisi Kelima). Informatika Bandung.

Prasetyo, W., & Tamyiz, M. (2017). Vehicle Routing Problem Dengan Aplikasi Metode Nearest Neihbor. Route Construction and Local Search Algorithms Inform. System Operation Research, 3(2), 39:104-118

Putra, F. D., Rakhmawati, F., & Cipta, H. (2021). Penentuan Rute Transportasi Kendaraan Umum Kota Medan Dengan Menggunakan Nearest Neighbor Method Dan Closed Insertion Method. Zeta - Math Journal, 6(2), 6–10. doi:10.31102/zeta.2021.6.2.6-10

Mirza, A. H., & Irawan, D. (2020). Implementasi Metode Saving Matrix Pada Sistem Informasi Distribusi Barang. Jurnal Ilmiah Matrik, 22(3), 316–324. doi:10.33557/jurnalmatrik.v22i3.1050.

Piah, S. (2019). Evektivitas Algoritma Clarke-Wright Dan Sequential Insertion Dalam Penentuan Rute Pendistribusian Tabung Gas LPG. Universitas Negeri Semarang

ryani, Kuncoro, D. K. R., & Fathimahhayati, L. D. (2018). Perbandingan Penerapan Metode Nearest Neighbour dan Sequential Insertion Untuk Penentuan Rute Distribusi Optimal Produk Roti UMKM Hasan Bakery. Profisiensi, 6(1), 41–49.

th, P., & Vigo, D. (2002). The Vehicle Routing Problem (Pertama). Universita Degli Studi Bologna.




DOI: https://doi.org/10.33387/jiko.v7i1.7443

Refbacks

  • There are currently no refbacks.