Usulan Jadwal Dan Rute Pendistribusian Bbm Pada Vrp Multiple Trip, Split Delivery, Time Window, Dan Heterogenous Fleet Menggunakan Algoritma Tabu Search Untuk Mengurangi Total Biaya Operasional Pengiriman (studi Kasus Di Pt Klm)

Ony Azwida Sari, Dida Diah Damayanti, Budi Santosa

Abstract

Abstrak PT KLM merupakan salah satu mitra dari PT PERTAMINA yang melakukan kegiatan berupa pendistribusian bahan bakar minyak jenis HSD (Head Speed Diesel) Solar dari DEPOT milik PT PERTAMINA untuk didistribusikan ke PLTD. Berdasarkan data pada bulan Juli-Desember 2016 milik PT KLM bahwa terjadi permasalahan, dimana terjadinya keterlambatan dalam pengiriman bahan bakar minyak sehingga menyebabkan pengeluaran biaya pinalty. Penyebab terjadinya keterlambatan ialah waktu dan jarak tempuh yang tidak efisien karena belum adanya jadwal dan rute pendistribusian yang tepat. Dalam mendistribusikan bahan bakar minyak tersebut, PT KLM memiliki armada transportasi berupa mobil tanki sejumlah 9 buah dengan 2 varian kapasitas. Maka permasalahan ini dapat diselesaikan dengan menggunakan pendekatan Vehicle Routing Problem (VRP) dengan karakteristik time window, multiple trip, split delivery, dan heterogenous fleet. Pada karakteristik tersebut menunjukkan bahwa permasalahan VRP yang dihadapi oleh PT. KLM cukup kompleks, sehingga harus diselesaikan dengan pendekatan metaheuristik berupa algoritama Tabu Search. Dengan solusi awal berupa algoritma Nearest Neighbor. Hasil dari perhitungan algoritma tersebut dapat mengurangi jarak tempuh dan waktu tempuh sebesar 9,4%, meminimasi keterlambatan, penurunan biaya total operasional pengiriman hingga 16,27%, serta penurunan jumlah kendaraan yang digunakan sebesar 12,5%.

Kata Kunci : Vehicle Routing Problem (VRP), Time Window, Heterogeneous Fleet, Multiple Trip, Split Delivery, Algoritma Nearest Neighbor, Algoritma Tabu Search.

Abstract PT KLM is one of the partners of PT PERTAMINA who conducts activities in the form of distribution of fuel of HSD (Head Speed Diesel) Solar from depot owned by PT PERTAMINA to be distributed to PLTD. Based on data in July-December 2016 owned by PT KLM that there is a problem, where the occurrence of delay in the delivery of fuel oil causing the expense of pinalty expenses. The cause of delay is the time travel and distance is not efficient because there is no schedule of the appropriate distribution routes. In distributing fuel oil, PT KLM has a fleet of 9 tankers with 2 variants of capacity. So, this problem can be solved by using Vehicle Routing Problem (VRP) approach with characteristics of time window, multiple trip, split delivery, and heterogenous fleet. On these characteristics indicate that the problem of VRP faced by PT KLM is quite complex, so it must be solved with a metaheuristic approach in the form of Tabu Search Algorithm, with the initial solution of Nearest Neighbor Algorithm. The result of the algorithm calculation can reduce the mileage and time travel by 9,4%, minimize the delay, decrease the total shipping operational cost up to 16,27%, and decrease the number of vehicles used by 12,5%.

Key Words : Vehicle Routing Problem (VRP), Time Window, Heterogeneous Fleet, Multiple Trip, Split Delivery, Nearest Neighbor Algorithm, Tabu Search Algorithm.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.
max_upload :0