ANALISIS PEMILIHAN RUTE OPTIMAL DALAM PROSES DISTRIBUSI REPLENISHMENT UNIT ATM MENGGUNAKAN METODE NEAREST INSERTION HEURISTIC PERSOALAN VEHICLE ROUTING PROBLEM WITH TIME WINDOWS - Robbie Arsyadanie Kana Nabhana; Zainal Fanani Rosyada (Industrial Engineering Online Journal, 2023)
AbstrakPemilihan rute menjadi salah satu faktor kunci upaya penghematan biaya dalam suatu proses distribusi. PT Bringin Gigantara merupakan perusahaan jasa di Indonesia yang bergerak dibidang manajemen uang terintegrasi dibawah naungan Bank BRI. Salah satu aktivitas yang dilakukan adalah proses pengisian ulang pada unit-unit ATM. Saat ini pemilihan rute distribusi untuk proses pengisian ulang berdasarkan perkiraan saja tanpa adanya suatu metode untuk menghitung jarak yang ditempuh. Terdapat 25 ATM yang harus diisi ulang dengan kapasitas angkut terbatas dan setiap unit ATM memiliki batas waktu pengisian yang berbeda-beda. Hal tersebut mengakibatkan tim pengisian ulang dapat melewati jalur unit ATM lebih dari sekali dan menyebabkan pertambahan jarak yang mengakibatkan meningkatnya biaya transportasi. Oleh karena itu dibutuhkan suatu metode pemilihan rute distribusi dengan sejumlah kendaraan berkapasitas tertentu dan melakukan pelayanan di berbagai lokasi terpisah dan memiliki batasan jangka waktu berbeda-beda. Penelitian ini menggunakan metode Nearest Insertion Heuristic pada persoalan Vehicle Routing Problem with Time Window (VRPTW). Hasil penelitian diperoleh pemilihan rute 2 ATM yang dibagi menjadi 4 tim. Tim 1 memperoleh jarak tempuh sebesar 8.874 km, Tim 2 memperoleh jarak tempuh sebesar 12.672 km, Tim 3 memperoleh jarak tempuh sebesar 11.820 km, dan Tim 4 memperoleh jarak tempuh sebesar 29.088 km. Terdapat penghematan total jarak tempuh sebesar 14.426 km dibandingkan pemilihan rute awal.Kata kunci: Vehicle Routing Problem with Time Window (VRPTW), Nearest Insertion HeuristicAbstractRoute selection is one of the key factors in cost-saving efforts in distribution process. PT Bringin Gigantara is a service company in Indonesia engaged in integrated money management under the auspices of Bank BRI. One of the activities carried out is the replenishment process at ATM units. Currently, the selection of distribution routes for the replenishment process is based on estimates alone without a method to calculate the distance traveled. There are 25 ATMs that must be replenish with limited carrying capacity and each ATM unit has a different charging time limit. This resulted in the refilling team being able to pass through the ATM unit line more than once and causing an increase in distance which resulted in increased transportation costs. Therefore we need a method of selecting distribution routes with a certain number of vehicles with a certain capacity and providing services in various separate locations and having different time limits. This study uses the Nearest Insertion Heuristic method on the Vehicle Routing Problem with Time Window (VRPTW). The results of the study obtained the selection of 25 ATM routes which were divided into 4 teams. Team 1 obtained a mileage of 8,874 km, Team 2 obtained a mileage of 12,672 km, Team 3 obtained a mileage of 11,820 km, and Team 4 obtained a mileage of 29,088 km. There is a total mileage savings of 14,426 km compared to the initial route selection.Keywords: Vehicle Routing Problem with Time Window (VRPTW), Nearest Insertion Heuristic