Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Industrial Engineering Online Journal
Robbie Arsyadanie Kana Nabhana
Departemen Teknik Industri, Fakultas Teknik, Universitas Diponegoro, Jl. Prof. Soedarto, SH, Kampus Undip Tembalang, Semarang, Indonesia 50275
Industrial & Manufacturing Engineering

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

 1 
MODEL OPTIMASI DISTRIBUSI CASH REPLENISHMENT UNIT ATM PERSOALAN VEHICLE ROUTING PROBLEM WITH TIME WINDOWS (Studi Kasus Pada PT XYZ Sub Lokasi Madiun Robbie Arsyadanie Kana Nabhana; Ary Arvianto; Zainal Fanani Rosyada
Industrial Engineering Online Journal Vol 12, No 2 (2023): WISUDA PERIODE APRIL TAHUN 2023
Publisher : Program Studi Teknik Industri, Fakultas Teknik, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

AbstrakPT XYZ yang melayani pendistribusian uang ke unit-unit ATM mitra kerjanya berusaha mencegah adanya cash out pada mesin ATM karena mempengaruhi potongan arus kas dari bank mitra yang berimbas kepada pemotongan gaji hingga pemecatan karyawan. Rekapitulasi menunjukkan rata-rata availability unit ATM sebesar 96,40%, hasil tersebut berada di bawah standard perusahaan sebesar 99%. Tujuan dalam penelitian ini adalah membangun model matematis untuk pemilihan rute proses distribusi Cash Replenishment, menyusun rute paling optimal untuk melakukan proses distribusi Cash Replenishment, dan membandingkan hasil pemilihan rute yang dibuat dalam model matematis penelitian ini dengan rute yang dibuat sesuai kebijakan perusahaan. Metode yang digunakan adalah Vehicle Routing Problem With Time Window (VRPTW) dengan algoritma Nearest Insertion Heuristic untuk menentukan titik guna disisipkan dengan mencari titik bebas yang paling dekat dengan suatu titik pada tur. Komputasi model matematis yang dibuat menghasilkan 8 tour dimana tour mewakili jumlah kendaraan yang digunakan. Tur 1 terdiri 2 rute, tur 2 terdiri 2 rute, dan tur 3 hingga tur 8 masing-masing terdiri 1 rute dengan total jarak tempuh 1.643,34 km dan tidak terdapat cash out. Pemilihan tur dan rute perusahaan menghasilkan 8 tur dengan masing-masing tur terdiri dari 1 rute, total jarak tempuh yang dihasilkan sebesar 3.790,8 km dan terdapat 2 unit ATM cash out.Kata kunci: Vehicle Routing Problem with Time Windows, Nearest Insertion Heuristic, Cash Replenishment.PT XYZ, which serves the distribution of money to its partner ATM units, tries to prevent cash out on ATM machines because it affects cash flow deductions from partner banks which have an impact on salary cuts to employee dismissal. The recapitulation shows that the average availability of ATM units is 96.40%, which is below the company standard of 99%. The objectives of this study are to build a mathematical model for route selection for the Cash Replenishment distribution process, to develop the most optimal route to carry out the Cash Replenishment distribution process, and to compare the route selection results made in the mathematical model of this study with the route made according to company policy. The method used is Vehicle Routing Problem With Time Window (VRPTW) with Nearest Insertion Heuristic algorithm to determine the point to insert by finding the free point closest to a point on the tour. The computation of the mathematical model created produces 8 tours where the tur represents the number of vehicles used. Tour 1 consists of 2 routes, tur 2 consists of 2 routes, and tur 3 to tur 8 each consists of 1 route with a total mileage of 1,643.34 km and no cash out. The selection of company turs and routes resulted in 8 tours with each tur consisting of 1 route, the total mileage generated was 3,790.8 km and there were 2 cash out ATM units.Keywords: Vehicle Routing Problem with Time Windows, Nearest Insertion Heuristic, Cash Replenishment.
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 Vol 12, No 2 (2023): WISUDA PERIODE APRIL TAHUN 2023
Publisher : Program Studi Teknik Industri, Fakultas Teknik, Universitas Diponegoro

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

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
Co-Authors Ary Arvianto Zainal Fanani Rosyada