relation: http://repository.upi.edu/142033/
title: ANALISIS RUTE PENGIRIMAN BARANG PADA DISTRIBUTION CENTER X MENGGUNAKAN METODE SWEEP ALGORITHM
creator: Retno Ulan Ndari, -
creator: Juang Akbardin, -
creator: Dwi Novi Wulansari, -
subject: HE Transportation and Communications
subject: T Technology (General)
description: Perencanaan rute yang tidak efisien pada Distribution Center (DC) X menyebabkan keterlambatan armada kembali ke DC, sehingga menyebabkan perpanjangan waktu kerja hingga empat jam dari batas operasional. Penelitian ini bertujuan merancang dan mengimplementasikan model komputasi untuk mengoptimalkan rute pengiriman barang guna mengatasi keterlambatan dan meningkatkan efisiensi penggunaan armada. Penelitian ini menggunakan sweep algorithm untuk pembentukan cluster pengiriman dan nearest insertion untuk menentukan urutan kunjungan optimal pada setiap cluster dengan pendekatan Multi Trip Vehicle Routing Problem (MTVRP). Proses optimasi dikembangkan dalam model komputasi berbasis Visual Basic. Hasil penelitian menunjukkan bahwa model yang diusulkan berhasil mengeliminasi keterlambatan armada. Rute usulan terlama memiliki waktu tempuh 437 menit, masih berada dalam batas operasional normal yaitu 450 menit. Alokasi rute dengan skema multi-trip menghasilkan rata-rata penggunaan 16 armada per hari, atau menurunkan kebutuhan armada sebesar 11,1% dibanding kondisi awal. Dengan demikian, pendekatan ini terbukti efektif dalam mengatasi keterlambatan dan mengurangi jumlah armada yang dibutuhkan di DC X.    Inefficient route planning at Distribution Center (DC) X causes delays in the fleet returning to the DC, resulting in extended working hours of up to four hours beyond operational limits. This study aims to design and implement a computational model to optimize delivery routes in order to address delays and improve fleet utilization efficiency. This study uses a sweep algorithm for delivery cluster formation and nearest insertion to determine the optimal visit sequence for each cluster using the Multi-Trip Vehicle Routing Problem (MTVRP) approach. The optimization process was developed in a Visual Basic-based computational model. The results of the study show that the proposed model successfully eliminates fleet delays. The longest proposed route has a travel time of 437 minutes, still within the normal operational limit of 450 minutes. Route allocation using the multi-trip scheme results in an average fleet usage of 16 vehicles per day, reducing fleet requirements by 11.1% compared to the initial condition. Thus, this approach has proven effective in addressing delays and reducing the number of vehicles required at DC X.
date: 2025-08-25
type: Thesis
type: NonPeerReviewed
format: text
language: id
identifier: http://repository.upi.edu/142033/1/S_TL_2104865_Title.pdf
format: text
language: id
identifier: http://repository.upi.edu/142033/2/S_TL_2104865_Chapter1.pdf
format: text
language: id
identifier: http://repository.upi.edu/142033/3/S_TL_2104865_Chapter2.pdf
format: text
language: id
identifier: http://repository.upi.edu/142033/4/S_TL_2104865_Chapter3.pdf
format: text
language: id
identifier: http://repository.upi.edu/142033/5/S_TL_2104865_Chapter4.pdf
format: text
language: id
identifier: http://repository.upi.edu/142033/6/S_TL_2104865_Chapter5.pdf
format: text
language: id
identifier: http://repository.upi.edu/142033/7/S_TL_2104865_Appendix.pdf
identifier:   Retno Ulan Ndari, - and Juang Akbardin, - and Dwi Novi Wulansari, -  (2025) ANALISIS RUTE PENGIRIMAN BARANG PADA DISTRIBUTION CENTER X MENGGUNAKAN METODE SWEEP ALGORITHM.  S1 thesis, Universitas Pendidikan Indonesia.   
relation: https://repository.upi.edu/