Puspitasari, Yuni (2017) Penentuan Rute Distribusi Produk Mie Menggunakan Algoritma Heuristik Klasik dan Cluster Based Optimization Approach pada PT. Surya Pratista Hutama (Suprama) Cabang Malang. Sarjana thesis, Universitas Brawijaya.
Abstract
PT. Surya Pratista Hutama (Suprama) Cabang Malang merupakan kantor cabang perusahaan yang berperan sebagai distribution center dan bertanggung jawab terhadap proses distribusi produk menuju wilayah Malang dan sekitarnya. Sebagai distribution center, PT. Suprama Cabang Malang perlu mengoptimalkan manajeman distribusi dan transportasi nya mengingat pentingnya jaringan distribusi dan transportasi dalam sebuah perusahaan. Jaringan distribusi dapat berperan sebagai titik penyalur produk maupun informasi serta sebagai sarana penciptaan nilai tambah terkait dengan service level yang dapat dicapai. Jaringan transportasi dapat memberikan pengaruh pada performasi sebuah rantai pasok terkait dengan pencapaian tingkat responsif perusahaan dalam merespon permintaan pelanggan. Penelitian ini dilakukan untuk merancang rute distribusi PT. Suprama Cabang Malang sehingga dapat diketahui rute optimal yang dapat dibentuk, total biaya distribusi yang diperlukan serta perbandingan rute usulan dengan rute eksisting perusahaan. Pada penelitian ini dilakukan perancangan rute distribusi produk menuju retail dengan menggunakan konsep vehicle routing problem (VRP). Rute yang diharapkan adalah rute dengan total jarak tempuh serta biaya minimal tanpa melanggar kendala berupa batasan time windows serta kapasitas kendaraan yang tersedia. Penyelesaian dilakukan dengan menggunakan algoritma heuristik klasik dan algoritma cluster based optimization approach. Algortima heuristik klasik terdiri dari tahap construction heuristic dan improvement heuristic. Pada tahap construction heuristic akan digunakan algoritma saving matrix sedangkan pada tahap improvement heuristic menggunakan prosedur perbaikan 2-opt dan 3-opt. Algortima cluster based optimization approach terdiri dari dua tahap, yakni tahap clustering menggunakan algortima heuristic clustering dan tahap routing menggunakan program linier. Hasil penelitian menunjukkan bahwa rute usulan menggunakan algortima heuristik klasik memberikan hasil yang lebih baik dibandingkan dengan rute usulan menggunakan algortima cluster based optimization approach. Total jarak tempuh rute usulan dalam satu minggu menggunakan algoritma heuristik klasik adalah sebesar 2406.45 km dengan total biaya distribusi sejumlah Rp 14.246.747 sedangkan total jarak tempuh rute eksisting perusahaan adalah sebesar 3068.42 km dengan total biaya distribusi sejumlah Rp 17.012.686. Hal tersebut berarti rute usulan menggunakan algoritma heuristik klasik dapat memperpendek total jarak tempuh sebesar 661.97 km dan memberikan penghematan biaya sejumlah Rp 2.765.939 dengan persentase penghematan biaya sebesar 16.26%.
English Abstract
PT. Surya Pratista Hutama (Suprama) Malang Branch is a branch office which roles as the distribution center and is responsible for product’s distribution process toward Malang and surrounding area. As a distribution center, PT. Suprama Malang Branch need to optimize its distribution and transportation management considering the importance of distribution and transportation network in a company. Distribution network can roles as a supplier points of product and information, it also roles as a means for creating the added value related to the service level that can be achieved by company. While the transportation network can effect a supply chain’s performance related to the achievement of its level of responsiveness. This study was conducted to design PT. Suprama Malang Branch’s distribution routes so that the optimal routes which can be created, the total distribution cost which required and the comparison between proposed routes and existing routes can be known. Distribution routing in this study was conducted using vehicle routing problem (VRP) concept. The expected routes are routes with minimum total mileage and minimum total distribution cost without violating the constraints in form of time windows limitation and the capacity of vehicles that are available. Resolution was carried out using classical heuristic algorithm and cluster based optimization approach algorithm. Classical heuristic algorithm consists of construction heuristic phase and improvement heuristic phase. Saving matrix algorithm will be used on construction heuristic phase while 2-opt and 3-opt procedures will be used on improvement heuristic phase. Cluster based optimization approach algorithm also consist of two phase, which are clustering phase using heuristic clustering algorithm and routing phase using linear programming. Result of study show that proposed routes using classical heuristic algorithm give better solution than proposed routes using cluster based optimization approach algorithm. Total mileage for a week of the proposed routes is 2406.45 km with total distribution cost is Rp 14.246.747 while total mileage of existing routes is 3068.42 km with total distribution cost is Rp 17.012.686. Based on previous sentence, it means that the proposed routes can shorten the total mileage by 178.4 km and reducing the total distribution cost by Rp. 2.765.939 or 16.26% saving of cost percentage.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Identification Number: | SKR/FT/2017/423/051705025 |
| Uncontrolled Keywords: | supply chain management, vehicle routing problem, heuristik klasik, cluster based optimization approach. |
| Subjects: | 600 Technology (Applied sciences) > 658 General management > 658.7 Management of materials > 658.78 Internal control of material and physical distribution |
| Divisions: | Fakultas Teknik > Teknik Industri |
| Depositing User: | Budi Wahyono Wahyono |
| Date Deposited: | 04 Sep 2017 09:36 |
| Last Modified: | 14 Nov 2024 02:31 |
| URI: | http://repository.ub.ac.id/id/eprint/2061 |
![[thumbnail of YUNI PUSPITASARI.pdf]](http://repository.ub.ac.id/style/images/fileicons/text.png) |
Text
YUNI PUSPITASARI.pdf Download (3MB) |
Actions (login required)
 |
View Item |