Penentuan Rute Distribusi Vehicle Routing Problem Simultaneous Delivery Dan Pickup With Time Window (VRPSDPTW) Menggunakan Saving Method

Batu, Winda Suryani Lumban (2022) Penentuan Rute Distribusi Vehicle Routing Problem Simultaneous Delivery Dan Pickup With Time Window (VRPSDPTW) Menggunakan Saving Method. Other thesis, Institut Teknologi Sepuluh Nopember.

Text 02411840000051-Undergraduate_Thesis.pdf Restricted to Repository staff only Download (4MB) | Request a copy

Abstract

Vehicle Routing Problem (VRP) merupakan salah satu jenis permasalahan transportasi dimana penentuan rute distribusi untuk melayani sejumlah permintaan pelanggan dan rute kendaraan dimulai dan berakhir di depo. Semua permintaan pelanggan harus terpenuhi dan setiap pelanggan dilayani tepat satu kali. PT X merupakan perusahaan yang mendistribusikan produk-produk fast moving consumer goods (FMCG). Dalam melakukan pengiriman dari Distribution Center (DC) Surabaya untuk melayani modern trade masih belum optimal. Hal tersebut ditandai dengan adanya biaya overtime dalam pengiriman serta belum adanya penentuan rute untuk produk retur. Permasalahan tersebut dapat diselesaikan dengan VRPSDPTW dimana terdapat kendala berupa batasan waktu pada lokasi masing-masing konsumen dan penjemputan produk retur secara simultan saat melakukan pengiriman barang pada lokasi konsumen. Metode yang digunakan untuk menyelesaikan permasalahan tersebut adalah saving method dan nearest neighbor. Pengembangan algoritma yang diusulkan menggunakan Visual Basic Application (VBA). Hasil algoritma akan dibandingkan dengan kondisi eksisting dimana hasil algoritma mampu menghemat jarak tempuh kendaraan hingga 502,75 km. Algoritma VRPSDPTW yang dirancang mampu menghemat kebutuhan kendaraan sebanyak 6 kendaraan selama 5 hari serta meningkatkan utilisasi kendaraan sebesar 9,77%. Hal tersebut mempengaruhi total biaya yang dikeluarkan dalam proses pengiriman berkurang sebesar 23,27%. Selanjutnya dilakukan perhitungan sensitivitas terhadap demand dan time window modern trade. Hasil sensitivitas menunjukkan skenario terbaik adalah memperlonggar time window dimana mampu meningkatkan utilisasi sebesar 13,48% serta menurunkan total biaya sebesar 13,17% dibandingkan kondisi normal.
============================================================================================================================
Vehicle Routing Problem (VRP) is one type of transportation problem where the distribution route is determined to serve a number of customer requests and the vehicle route starts and ends at the depot. All customer requests must be met and each customer is served exactly once. PT X is a company that distributes fast moving consumer goods (FMCG) products. In making deliveries from the Distribution Center (DC) Surabaya to serve modern trade, it is still not optimal. This is indicated by the existence of overtime costs in shipping and the absence of a route determination for returned products. These problems can be solved with VRPSDPTW where there are constraints in the form of time limits at the location of each consumer and simultaneous pick-up of returned products when sending goods at the consumer's location. The method used to solve the problem is the saving method and nearest neighbor. The proposed algorithm development uses Visual Basic Application (VBA). The results of the algorithm will be compared with existing conditions where the results of the algorithm are able to save vehicle mileage up to 502.75 km. The designed VRPSDPTW algorithm is able to save the need for vehicles as much as 6 vehicles for 5 days and increase vehicle utilization by 9.77%. This affects the total costs incurred in the delivery process are reduced by 23.27%. Furthermore, the calculation of sensitivity to demand and the time window of modern trade is carried out. The sensitivity results show that the best scenario is to relax the time window which is able to increase utilization by 13.48% and reduce total costs by 13.17% compared to normal conditions.

Item Type:	Thesis (Other)
Uncontrolled Keywords:	Distribusi, Modern Trade, Penentuan Rute, Saving Method, Vehicle Routing Problem Simultaneous Delivery dan Pickup with Time Window. Distribution, Modern Trade, Routing, Saving Method, Vehicle Routing Problem Simultaneous Delivery and Pickup with Time Window
Subjects:	H Social Sciences > HD Industries. Land use. Labor > HD38.5 Business logistics--Cost effectiveness. Supply chain management. ERP
Divisions:	Faculty of Industrial Technology and Systems Engineering (INDSYS) > Industrial Engineering > 26201-(S1) Undergraduate Thesis
Depositing User:	Mr. Marsudiyana -
Date Deposited:	09 Feb 2026 04:11
Last Modified:	09 Feb 2026 04:11
URI:	http://repository.its.ac.id/id/eprint/132281

Actions (login required)

View Item