Usulan Rute Distribusi Air Minum Isi Ulang Galon Menggunakan Metode Saving Matrix
Kata Kunci:
Capacited Vehicle Routing Problem, Saving Matrix, Nearest Neighbor, Nearest Insert, Farthest Insert.Abstrak
Depot Vivi Water Cirebon sebagai salah satu Depot Air Minum Isi Ulang di Kabupaten Cirebon yang memiliki rute pendistribusian air minum isi ulang galon dengan target konsumen di beberapa lokasi berbeda. Pendistribusian belum memperhatikan rute pengiriman optimal, hanya perkiraan dari pihak pengirim. Oleh karena itu, dilakukan penelitian di depot ini dengan tujuan untuk mengoptimalkan rute pendistribusian air minum isi ulang galon dan mengatasi masalah Capacited vehicle routing problem (CVRP) dan vehicle routing problem with multiple trips (VRMPT) dengan menggunakan metode penyisipan urutan dari metode saving matrix, yaitu metode nearest neighbor, nearest insert, farthest insert. Hasil dari analisis tersebut membandingkan rute hasil metode saving matrix dengan rute aktual. Berdasarkan analisis diperoleh total jarak rute terkecil sebesar 649,75 km
dari metode nearest neighbor dan total jarak rute aktual sebesar 798,11 km. Sehingga rute usulan dengan metode nearest neighbor terpilih sebagai rute terbaik dengan utilitas 84,67% dengan persentase penghematan jarak 18,59%.
ABSTRACT
Depot Vivi Water Cirebon as one of the Refill Drinking Water Depots in Cirebon
Regency which has a distribution route for drinking gallon refill drinking water with
target consumers in several different locations. The distribution has not paid attention to
the optimal delivery route, only on estimates from Sender. Therefore, research was
carried out at this depot with the aim of optimizing the distribution route of gallon refill
drinking water and overcoming the capacited vehicle routing problem (CVRP) and
vehicle routing problem with multiple trips (VRMPT) by using sequence insertion
methods from the saving matrix method, those are nearest neighbor, nearest insert,
farthest insert method. The results of the analysis compare the route resulting from
the saving matrix method with the actual route. Based on the analysis, the smallest
total route distance is 649,75 km from the method nearest neighbor and the total
distance of the actual route is 798,11 km. So that the proposed route with the method
nearest neighbor was chosen as the best route with a utility of 84,67% with a
distance saving percentage of 18,59%.
