Implementasi Teknik Relokasi 1-0 pada Pengembangan Algoritma Sequential Insertion Untuk Perbaikan Solusi Awal Model VRP dengan Karakteristik Heterogeneous Fleet Size and Mx Vehicle Routing - Perkasa, Dwi Satria; Arvianto, Ary (Program Studi Teknik Industri, Fakultas Teknik, Universitas Diponegoro, 2015)
Transportasi dan distribusi erat kaitannya dengan perusahaan dalam mengirimkan produk ke pelanggan. Permasalahan pengiriman produk ke pelanggan ini dikenal dengan Vehicle Routing Problem (VRP). VRP memiliki berbagai varian model seperti yang telah dikembangkan penelitian sebelumnya. Dalam penelitian ini akan mengembangkan model VRP Heterogeneous fleet size and mix vehicle routing (HFSMVR), tujuannya meminimasi jumlah kendaraan, fungsi beban kerja, dan fungsi biaya. Penentuan jumlah dan rute kendaraan penelitian ini tetap mempertimbangkan aspek multiple product, multiple trips, multiple products and compartments, split delivery, dan multiple time windows. Teknik pemecahan masalah dalam penelitian ini menggunakan algoritma sequential insertion dan metode local search, serta improvement dengan operator relocation 1-0. Berdasarkan perhitungan model VRP Heterogeneous fleet size and mix vehicle routing (HFSMVR) didapatkan hasil kombinasi jenis kendaraan terpilih kapasitas 2.000 kiloliter dan 4.700 kiloliter yang menghasilkan jumlah tur 2, nilai TCT 265.76 jam dan RCT 70.24 jam dengan fungsi beban kerja 2.266.462,4 dan fungsi biaya sebesar Rp. 1.818.232.000, sedangkan hasil improvement relocation 1-0 didapatkan hasil jenis kendaraan terpilih 2.000 kiloliter dan 4.700 kiloliter yang menghasilkan jumlah tur 2, nilai TCT 272.27 jam dan RCT 63.73 jam dengan fungsi beban kerja yaitu 2.272.907,3 dan fungsi biaya sebesar Rp. 1.899.536.000. Abstract Transportation and distribution is closely related with company in delivering the products to the customer. The problem of delivering products is known as Vehicle Routing Problem (VRP). VRP has many variants which have been developed in the previous research. In this research we will develop a VRP Model heterogeneous fleet size and mix vehicle routing (HFSMVR), the goal is for minimizing the number of vehicle, workload function, and cost function. determination the number of vehicle and route which is still considering multiple product, multiple trips, multiple product and compartment, split delivery, and multiple time windows aspects. Problem solving techniques in this research using sequential insertion algorithm and local search method, also improvement with operator relocation 1-0. Based on the calculation of VRP Heterogeneous fleet size and mix vehicle routing (HFSMVR) model, showed a combined capacity of 2.000 and 4,700 kiloliters which have a tour number is 2, TCT value is 265.76 hours, and RCT value is 70.24 hours, and the value of workload function is 2.266.462,4 and cost function is Rp. 1.818.232.000. while the improvement result showed a combined capacity of 2,000 and 4,700 kiloliters which have a tour number is 2, TCT value is 272.27 hours, and RCT is 63.73 hours and workload function is 2.272.907,3 and cost function is Rp. Rp. 1.899.536.000.