USULAN RUTE DISTRIBUSI CAT MENGGUNAKAN METODE SAVING MATRIX DAN NEAREST NEIGHBOR DI CV. XYZ
Kata Kunci:
saving matriks, nearest neighbour, distribution, route, cost, distribusi,, rute, biayaAbstrak
The problem at CV. XYZ is the distribution of goods from the factory to the destination store which incurs expensive transportation costs because the company does not have a method of determining distribution routes. Therefore, it is necessary to determine the route to be followed so as to minimize transportation costs at CV. XYZ. Determination of transportation routes can be solved by the Saving matrix and Nearest Neighbor methods for the shortest distribution route and minimal cost. From the results of data analysis and processing with the application of the saving matrix method into 20 new routes, and the distance of each route is 1938 km. The total cost of transportation after the application of the method provides savings in distribution costs of Rp 3,023,480 / month.
Abstrak
Permasalahan pada CV. XYZ adalah distribusi barang dari pabrik ke toko tujuan yang menimbulkan biaya tranportasi mahal karena perusahaan tidak memiliki metode penentuan rute distribusi. Oleh karena itu, perlu dilakukan penentuan rute yang akan dilalui sehingga dapat meminimalkan biaya transportasi pada CV. XYZ. Penentuan rute transportasi dapat diselesaikan dengan metode Saving matrix dan Nearest Neighbour untuk rute distribusi yang terpendek dan biaya yang minimal. Dari hasil analisa dan penglolahan data dengan penerapan metode saving matrix menjadi 20 rute baru, dan didapat jarak masing-masing rute adalah 1938 km. Biaya total transportasi sesudah penerapan metode memberikan penghematan biaya distribusi sebesar Rp 3.023.480 /bulan.
