Optimasi Rute Distribusi Beras Menggunakan Metode Branch and Bound (Studi Kasus: PT. Sari Tani Indonesia Group)

Hidayati, Riris Emilia Nurul and Aunur Rofiq Mulyarto, STP., M.Sc. (2023) Optimasi Rute Distribusi Beras Menggunakan Metode Branch and Bound (Studi Kasus: PT. Sari Tani Indonesia Group). Sarjana thesis, Universitas Brawijaya.

Abstract

Beras merupakan makanan pokok bagi warga Indonesia, sehingga terjadi peningkatan permintaan beras setiap tahunnya seiring bertambahnya jumlah penduduk Indonesia. PT. Sari Tani Indonesia Group merupakan salah satu perusahaan yang bergerak pada bidang pengolahan pangan yaitu penggilingan beras. Produk beras yang dihasilkan antara lain Beras Putih Biru, Beras Tawon, Beras Padi Beruang, dan Beras Ikan Sangar yang dikemas dengan karung laminasi yang berbahan dasar plastik polypropylene (PP). Perusahaan memiliki retailer yang tersebar pada wilayah Mojokerto, Sidoarjo, Surabaya, Lamongan, dan Gresik. Tujuan penelitian yaitu mampu mengidentifikasi kondisi aktual rute pendistribusian PT. Sari Tani Indonesia Group. Menentukan rute optimal pendistribusian PT. Sari Tani Indonesia Group dengan pendekatan branch and bound. Penelitian yang saat ini dilakukan menggunakan metode Branch and Bound untuk permasalahan dalam penentuan rute terpendek distribusi beras. Metode Branch and Bound membagi persoalan menjadi sub masalah (branching) dengan membuat pohon pencarian dan mengerjakan batasan (bounding) untuk memperoleh solusi. Keunggulan metode Branch and Bound terdapat pada tingkat keefektifitasnya yaitu dengan menggunakan sejumlah solusi dalam memecahkan masalah dengan hasil atau solusi yang akurat dan optimal. Penelitian dilakukan di PT. Sari Tani Indonesia Group, Mojokerto yang dilaksanakan pada bulan Oktober hingga Desember 2022. Hasil analisis yaitu dapat diketahui permintaan tertinggi berada Kota Surabaya 205,75 dengan jumlah retailer 24. Dilakukan penyelesaian dengan algoritma branch and bound dengan percabangan pada 4 retailer. Pembuatan distance matrix dengan bantuan Google Maps untuk 43 retailer. Pengolahan data menggunakan VRP Spreadsheet Solver dengan membuat 2 skenario. Distribusi menggunakan 18 armada jenis Truk CDD kapasitas 20 ton dengan waktu running 55,298 detik. Berdasarkan hasil analisis disimpulkan bahwa adanya perubahan mekanisme pemesanan produk hingga proses pengiriman. Penentuan rute optimal sesuai dengan kapasitas kendaraan akan membuat proses distribusi lebih efektif. Penelitian masih memiliki kekurangan, oleh karena itu diharapkan penelitian selanjutnya mampu mempertimbangkan faktor kemacetan dan kondisi aktual jalan yang akan dipilih sebagai solusi rute optimal.

English Abstract

Rice is a staple food for Indonesian citizens, so there is an increase in demand for rice every year in line with the increasing population of Indonesia. PT. Sari Tani Indonesia Group is a company engaged in the field of food processing, namely rice milling. The rice products produced include White Blue Rice, Wasp Rice, Bear Rice Rice, and Sangar Fish Rice which are packaged in laminated sacks made of polypropylene (PP) plastic. Retail owner companies spread across the Mojokerto, Sidoarjo, Surabaya, Lamongan and Gresik areas. The aim of the research is to be able to position the actual condition of the distribution route of PT. Indonesian Sari Tani Group. Determine the optimal distribution route PT. Sari Tani Indonesia Group with a branch and bound approach. The research currently being carried out uses the Branch and Bound method for problems in determining the shortest route for rice distribution. The Branch and Bound method divides the problem into sub-problems (branching) by creating a search tree and working on the boundaries (bounding) to obtain a solution. The advantage of the Branch and Bound method lies in its level of effectiveness, namely by using a number of solutions in solving problems with accurate and optimal results or solutions. Research conducted at PT. Sari Tani Indonesia Group, Mojokerto which will be held from October to December 2022. The result of the analysis is that it can be seen that the highest demand is in the city of Surabaya 205.75 with 24 retailers. The settlement is carried out using the branch and boung algorithm with branches at 4 retailers. Making distance matrices with the help of Google Maps for 43 retailers. Data processing uses the VRP Spreadsheet Solver by making 2 scenarios. Distribution uses 18 fleets of CDD Trucks with a capacity of 20 tons with a running time of 55,298 seconds. Based on the results of the analysis it was concluded that there was a change in the product ordering mechanism to the delivery process. Determining the optimal route according to vehicle capacity will make the distribution process more effective. This research still has shortcomings, therefore it is hoped that further research will be able to consider the congestion factor and the actual condition of the road that will be chosen as the optimal route solution.

Item Type: Thesis (Sarjana)
Identification Number: 0523100054
Uncontrolled Keywords: Branch and Bound, Capacity Vehicle Routing Problem, Distribusi, Optimasi., Branch and Bound, Capacity Vehicle Routing Problem, Distribution, Optimization.
Subjects: 300 Social sciences > 338 Production > 338.1 Agriculture > 338.16 Production efficiency
Divisions: Fakultas Teknologi Pertanian > Teknologi Industri Pertanian
Depositing User: soegeng sugeng
Date Deposited: 22 May 2023 01:38
Last Modified: 22 May 2023 01:38
URI: http://repository.ub.ac.id/id/eprint/199942
[thumbnail of DALAM MASA EMBARGO] Text (DALAM MASA EMBARGO)
Riris Emilia Nurul Hidayati.pdf
Restricted to Registered users only until 31 December 2025.

Download (3MB)

Actions (login required)

View Item View Item