OPTIMALISASI PENENTUAN RUTE DISTRIBUSI PUPUK UNTUK MEMINIMALKAN BIAYA TRANSPORTASI DENGAN METODE SAVING MATRIX

Abstract

Product delivery must be in accordance with customer demand in a timely and efficient manner. So that the distribution process does not result in waste of time, distance, and energy. CV. XY is engaged in trading the needs of agricultural materials having problems in the distribution process. The sender's route itself changes over time depending on the driver's wishes. So there will be many different routes with one goal each. The goal is to produce a longer shipping path, without first looking at vehicle capacity and the distance that must be traveled. This results in expensive transportation costs. From data processing distribution using the Matrix Saving method obtained 4 new routes, namely Route 1 (DC - CUS 3 - CUS 10 - CUS 8 - CUS 6- DC), Route 2 (DC - CUS 4 - CUS 2 - CUS 7 - DC) , Route 3 (DC - CUS 5 - CUS - 9 - CUS 11 - DC), Route 4 (DC - CUS 1 - CUS 12 - DC). Distance saving and cost efficiency were obtained from 8 routes to 4 routes and total distance saving of 39.1 km. Saving in transportation costs of Rp. 12,825,120 or 50% per month. PENDAHULUAN