Penentuan Jalur Rute Distribusi Produk Fast Moving Consumer Goods (FMCG) dengan Menggunakan Metode Nearest Neighbour (Studi Kasus: PT.XYZ)
DOI:
https://doi.org/10.36722/sst.v5i2.357Abstract
Abstrak - PT. XYZ merupakan perusahaan logistik yang bergerak dalam pendistribusian produk ke seluruh area JABODETABEK. Dalam menjalankan aktivitas proses pendistribusian, perusahaan dihadapkan pada kondisi permasalahan yaitu perusahaan diharuskan untuk mengunjungi dan melayani konsumen dengan lokasi yang tersebar di area JABODETABEK dengan tetap memperhatikan kapasitas muatan dari armada dan rute yang dilalui kendaraan. Oleh karena itu, diperlukan penentuan rute yang tepat agar perusahaan dapat memenuhi pengiriman tepat waktu kepada konsumen. Dengan adanya masalah tersebut, penelitian ini bertujuan untuk melakukan optimasi rute kendaraan dengan metode nearest neighbor agar mampu meminimalisir total jarak, total waktu dan biaya distribusi yang kemudian akan dianalisa perbandingan data aktual dan nearest neighbor. Pada penelitian ini menggunakan metode nearest neighbor. Hasil yang didapatkan dari penelitian ini adalah: (1) Mampu mengurangi persentase rata-rata jarak tempuh kendaraan dalam bulan Oktober 2018 sebesar 27% atau 44,09 km tiap harinya, (2) Mengurangi total waktu tempuh 157 menit dari data aktual, (3) Mampu menghemat total biaya sebesar 15% atau Rp. 53,458 tiap harinya. Dengan demikian metode pendekatan nearest neighbor mampu mengurangi biaya distribusi yang dikeluarkan oleh perusahaan tiap bulan.
Abstract – PT. XYZ is a logistics company engaged in the distribution of products throughout the Greater Jakarta area. In carrying out the distribution process activities, the company is faced with the requirements of the problem about the company required to provide information and serve consumers with locations scattered in the Greater Jakarta area with due regard to capacity of vehicle and route. Therefore, it is necessary to determine the right route so that companies can meet timely deliveries to consumers. Given these problems, this study aims to optimize vehicle routes with the nearest neighbor method so as to minimize the time and cost of distribution which will then be analyzed to analyze the actual data and the nearest neighbors. In this study using the nearest neighbor method. The results obtained from this study are: (1) Able to reduce the average percentage of vehicle mileage in October 2018 by 27% or 44,09 km per shipment. (2) reduce total travel time of 157 minute from actual data, (3) Able to increase total costs by 15% or Rp. 53,458. Thus,the method of taking the nearest neighbor can reduce the distribution costs incurred by the company each month.
Keywords – Distribution cost, Nearest neighbor, Route determination
References
A. Aliyuddin, P. S. Puspitorini and M. Muslimin, "Metode Vehicle Routing Problem (VRP) dalam Mengoptimalisasikan Rute Distribusi Air minum PT. SMU," Seminar Nasional Teknik Industri, Surabaya, 2017.
P. Toth and D. Vigo, The Vehicle Routing Problem, Philadelphia: SIAM, 2002.
W. Prasetyo and M. Tamyiz, "Vehicle Routing Problem dengan Aplikasi Metode Nearest Neighbor," Journal of Research and Technology, Vol. 3, No. 2, pp. 88-99, 2017.
O. Braysy and M. Gendreau, "Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms," System Operations Research and Technology, Vol. 39, pp. 104-118, 2005.
L. Leymena, B. W. C. Suryo, Yuniaristanto and W. Sutopo, "Analisis Penentuan Rute Distribusi Menggunakan Metode," Seminar dan Konferensi Nasional IDEC 2019, Surakarta, 2019.
