Heterogeneous Vehicle Routing Problem with Time Windows (HVRPTW) and Vehicle Range Limits Model pada Sistem Distribusi PT Freeport Indonesia

Ibrohim, Anisah Amalia Nur (2023) Heterogeneous Vehicle Routing Problem with Time Windows (HVRPTW) and Vehicle Range Limits Model pada Sistem Distribusi PT Freeport Indonesia. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 02411940000006-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only until 1 October 2025. Download (7MB) | Request a copy

Abstract

Meningkatnya demand dan unloading point yang tidak diiringi dengan kemampuan armada dalam melakukan sistem distribusi, menyebabkan PT Freeport Indonesia melakukan evaluasi kembali terhadap rute eksisting masing-masing armada. Harapannya didapatkan sistem distribusi yang optimal dan performansi pengiriman yang lebih baik. Penelitian tugas akhir ini mengembangkan model VRP untuk karakteristik time windows, heterogeneous fleet, dan vehicle range limits agar target-target yang ditetapkan oleh perusahaan dapat terpenuhi. Target yang dimaksud berupa material dapat dikirim dalam kurun waktu dua hari, dan minimal 90% line item reservasi material dapat dikirim melalui SCM Delivery. Kendaraan yang beroperasi dalam penelitian ini terdapat tiga jenis dengan kapasitas yang berbeda yaitu Iveco 6x6, Iveco 4x4, dan WS 6x6 Flatbed. Ketiga jenis armada tersebut tidak seluruhnya dapat memasuki area user. Hal ini dapat disebabkan baik dari faktor kendaraan yang tidak mumpuni untuk melewati jalan tersebut ataupun kondisi medan yang ada. Kendaraan yang memiliki batasan tersebut yaitu Iveco 6x6 tidak dapat memasuki area bawah tanah (underground), dan Iveco 4x4 tidak dapat memasuki UG BGS (underground bigosan). Untuk menyelesaikan permasalahan ini, solusi dibangun menggunakan pendekatan heuristik, yaitu algoritma nearest neighbor. algoritma ini dipilih dikarenakan lebih sederhana dan cepat dalam menyelesaikan permasalahan yang kompleks. Model ini dilakukan running dengan menyusun empat skenario yang menyatakan kondisi yang berbeda sesuai kapabilitas armada dalam menjangkau suatu area. Berdasarkan hasil running, didapatkan skenario 4 memiliki nilai fungsi objektif terendah. Dalam skenario 4 dibutuhkan armada truk sebanyak 3 unit WS 6x6 Flatbed yang menyusuri seluruh area drop point. Dalam skenario ini, total waktu penyelesaian tur seluruh kendaraan dihasilkan sebesar 755 menit atau 12 jam 35 menit. Dari hasil masing-masing skenario, perusahaan dapat menjadikan referensi dalam mengambil keputusan untuk mencapai target perusahaan.
================================================================================================================================
The increasing demand and unloading points that were not accompanied by the fleet's ability to carry out a distribution system, caused PT Freeport Indonesia to re-evaluate the existing routes of each fleet. The hope is to get an optimal distribution system and better delivery performance. This final project research develops VRP models for the characteristics of time windows, heterogeneous fleets, and vehicle range limits so that the targets set by the company can be met. The target is materials can be sent within two days, and a minimum of 90% of material reservation line items can be sent through SCM Delivery. There are three types of vehicles operating in this study, namely Iveco 6x6, Iveco 4x4, and WS 6x6 Flatbed. The three types of fleets are not all able to enter the user area. This can be caused either by factors of vehicles that are not qualified to pass the road or existing terrain conditions. Vehicles that have these restrictions, Iveco 6x6 cannot enter the underground area, and Iveco 4x4 cannot enter UG BGS (underground bigosan). To solve this problem, the solution is built using a heuristic approach, nearest neighbor algorithm. This algorithm is chosen because it is
simpler and faster in solving complex problems. This model is carried out by compiling four scenarios that state different conditions according to the fleet's capability in reaching an area. Based on the running results, it is found that scenario 4 has the lowest objective function value. In scenario 4, a fleet of 3 WS 6x6 Flatbed trucks is needed to explore the entire drop point area. In this scenario, the total completion time of the entire vehicle tour is generated at 755 minutes or 12 hours 35 minutes. From the results of each scenario, the company can make a reference in making decisions to achieve company targets.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Heterogeneous Fleet, Nearest Neighbor, Time Windows, Vehicle Range Limits, Vehicle Routing Problem === Heterogeneous Fleet, Nearest Neighbor, Time Windows, Vehicle Range Limits, Vehicle Routing Problem
Subjects:	H Social Sciences > HE Transportation and Communications > HE336.R68 Route choice H Social Sciences > HF Commerce > HF5415.7 Physical distribution management T Technology > TE Highway engineering. Roads and pavements > TE7 Transportation--Planning
Divisions:	Faculty of Industrial Technology and Systems Engineering (INDSYS) > Industrial Engineering > 26201-(S1) Undergraduate Thesis
Depositing User:	Anisah Amalia Nur Ibrohim
Date Deposited:	19 Jul 2023 06:33
Last Modified:	19 Jul 2023 06:44
URI:	http://repository.its.ac.id/id/eprint/98584

Actions (login required)

View Item