Farezi, Irgi Ahmad and Purnama, Anggi Widya and Pakpahan, Hartati M. (2021) PERANCANGAN RUTE TRANSPORTASI PENDISTRIBUSIAN PRODUK UNILEVER DENGANMENGGUNAKAN METODE ALGORITMA TABU SEARCH (TA 13.16.21.69). Diploma thesis, STIMLOG INDONESIA.
![[img]](http://eprint.ulbi.ac.id/style/images/fileicons/text.png) |
Text
3. BAB I PENDAHULUAN.pdf Download (114kB) |
Abstract
ABSTRAK Permasalahan mengenai kesulitan dalam menentukan rute distribusi yang optimal berdampak pada biaya transportasi yang besar. Rute yang dilalui pada saat pengiriman produk unilever masih berdasarkan pengalaman dari sopir. Selain itu, kendaraan yang digunakan memiliki kapasitas yang terbatas untuk melakukan pengiriman dari depot ke tujuan, jarak dan jumlah permintaan yang berbeda-beda. Untuk rute eksisting perusahaan diawali fleet I yaitu mencapai total jarak tempuh 67,8 kilometer rute yang dilalui adalah Depot (A1) – Borma Margacinta (A13) – Borma Gempol (A9) – Borma Caringin (A3) – Borma Cijerah (A2) – Borma Riung (A10) – Borma Rancabolang (A18) – Depot (A1) dengan permintaan 490 dus dengan waktu pelayanan 326,7 menit dan biaya pengiriman Rp.646.368. Untuk fleet II mencapai 81,8 kilometer rute yang dilalui (A1) – Borma BuahBatu (A4) – Borma Kircon (A6) – Borma TKI Kopo (A5) Borma Antapani (A11) – Borma Kopo (A7) – Borma Cibaduyut ( A12 ) – Depot ( A1 ) dengan total permintaan 517 yang memiliki waktu pelaynan 346,6 menit dan biaya pengiriman Rp.659.528 dengan total biaya transportasi Rp.1.305.896/ hari. Karena hal tersebut perusahaan mencoba mencari rute yang memiliki jarak terpendek agar dapat meminimalkan biaya transportasi pada saat pendistribusian produk. Penelitian ini menggunakan metode Algoritma Sweep untuk mencari solusi awal kemudian dilanjutkan dengan mencari rute terpendek mengguakan metode Tabu Search selanjutnya, menghitung total biaya transportasi dari rute yang sudah didapat dari Tabu search. Dari hasil pengolahan data tersebut didapat hasil pengolahan hari senin rute fleet I dimulai dari depot (A1) – Borma Cibaduyut (A12) – Borma Cijerah (A2) – Borma Gempol (A9) – Borma TKI Kopo (A5) – Borma Kopo (A7) – Borma Caringin (A3) – Depot (A1) dengan total jarak tempuh 26,5 km dan biaya transportasi Rp. 607.546/ kend-hari memiliki waktu pelayanan 264,7 menit. fleet II dimulai Depot (A1) – Borma Margacintan (A13) – Borma Kircon (A6) – Borma Antapani (A11) – Borma Riung (A10) – Borma Rancabolang (A8) – Borma Buahbatu (A4) - Depot (A1) dengan total jarak tempuh 34,3 km dan biaya transportasi Rp. 614.878/ kend-hari memliki waktu pelayanan 276,4 menit dengan total biaya transportasi sebesar Rp. 1.222.423/ hari. Untuk perbandingan % GAP rute usulan lebih pendek dibandingkan dengan rute eksisting yang memiliki kesenjangan – 61% , sedangkan perbandingan %GAP biaya transportasi usulan lebih hemat dibandingkan biaya transportasi eksisting yang memiliki kesenjangan -6%. Kata Kunci : Distribusi, Algoritma Sweep, Tabu Search, Biaya transportasi ABSTRACT The problem of difficulty in determining the optimal distribution route has an impact on large transportation costs. The route taken at the time of delivery of Unilever products is still based on the experience of the driver. In addition, the vehicles used have a limited capacity to make deliveries from the depot to the destination, the distance and the number of requests vary. For the company's existing routes, starting with fleet I, which reaches a total distance of 67.8 kilometers, the routes taken are Depot (A1) - Borma Margacinta (A13) - Borma Gempol (A9) - Borma Caringin (A3) - Borma Cijerah (A2) - Borma Riung (A10) – Borma Rancabolang (A18) – Depot (A1) with a request of 490 boxes with a service time of 326.7 minutes and a delivery fee of Rp.646.368. For fleet II, the route reached 81.8 kilometers (A1) – Borma BuahBatu (A4) – Borma Kircon (A6) – Borma TKI Kopo (A5) Borma Antapani (A11) – Borma Kopo (A7) – Borma Cibaduyut (A12 ) – Depot (A1) with a total request of 517 which has a service time of 346.6 minutes and a delivery fee of Rp. 659,528 with a total transportation cost of Rp. 1,305,896/day. Because of this the company tries to find a route that has the shortest distance in order to minimize transportation costs during product distribution. This study uses the Sweep Algorithm method to find the initial solution and then proceeds to find the shortest route using the next Tabu Search method, calculating the total transportation costs of the routes that have been obtained from Tabu search. From the results of data processing, the results of Monday's processing of the fleet I route started from the depot (A1) - Borma Cibaduyut (A12) – Borma Cijerah (A2) – Borma Gempol (A9) – Borma TKI Kopo (A5) – Borma Kopo (A7) – Borma Caringin (A3) – Depot (A1) with a total distance of 26.5 km and transportation costs of Rp. 607,546/veh-day has a service time of 264.7 minutes. fleet II starts Depot (A1) – Borma Margacintan (A13) – Borma Kircon (A6) – Borma Antapani (A11) – Borma Riung (A10) – Borma Rancabolang (A8) – Borma Buahbatu (A4) - Depot (A1) with a total mileage 34.3 km and transportation costs Rp. 614,878/vehicle-day has a service time of 276.4 minutes with a total transportation cost of Rp. 1,222,423/day. For the comparison of %GAP the proposed route is shorter than the existing route which has a gap of -61%, while the comparison of %GAP of the proposed transportation cost is more efficient than the existing transportation cost which has a gap of -6%. Keywords: Distribution, Sweep Algorithm, Tabu Search, Transportation costs.
| Item Type: | Thesis (Diploma) |
|---|---|
| Subjects: | H Social Sciences > HE Transportation and Communications |
| Depositing User: | Unnamed user with email [email protected] |
| Date Deposited: | 19 Apr 2022 02:38 |
| Last Modified: | 19 Apr 2022 02:38 |
| URI: | http://eprint.ulbi.ac.id/id/eprint/657 |
Actions (login required)
 |
View Item |
