Indriyana, Savionita Devi (2018) Penentuan Rute Distribusi Tissue Dalam VRPTW Menggunakan Algoritma Sweep dan Mixed Integer Linear Programming. Sarjana thesis, Universitas Brawijaya.
Abstract
PT. Graha Kerindo Utama Denpasar merupakan salah satu kantor cabang yang membawahi pendistribusian produk tissue dengan permintaan dari berbagai retailer di wilayah Bali. Dalam melakukan proses distribusi terdapat batasan waktu pada retailer dengan memperhatikan jam buka atau tutup (08.00-16.00) retailer dapat dilayani. Saat ini dalam menentukan rute distribusi, perusahaan belum dapat merencanakan secara optimal karena tidak mempertimbangkan aspek jarak antar daerah, waktu tempuh, dan biaya distribusi. Hal ini menyebabkan pembagian rute dengan cara tersebut belum mampu memberikan hasil rute yang ditempuh kendaraan saat ini merupakan rute yang optimal. Dengan adanya penentuan rute distribusi ini diharapkan perjalanan armada transportasi menjadi terarah sehingga dapat megurangi jarak tempuh serta waktu tempuh dan meminimalkan biaya transportasi. Permasalahan distribusi pada PT. Graha Kerindo Utama Denpasar dapat diselesaikan dengan menggunakan Algoritma Sweep dan Mixed Integer Linear Programming. Jumlah retailer dalam penelitian ini tersebar di beberapa wilayah di Bali sebanyak 40 retailer. Kemudian dilakukan clustering menggunakan Algoritma Sweep berdasarkan urutan sudut polar dari keadaan titik geografis antar wilayah, lalu dilanjutkan penyelesaian permasalahan TSP pada masing-masing cluster dengan metode eksak Mixed Integer Linear Programming (MILP). Pada mixed integer linear programming ditentukan formulasi matematis yaitu meliputi variabel keputusan, fungsi tujuan, dan fungsi kendala. Fungsi tujuan dalam model ini adalah meminimasi jarak tempuh kendaraan. Fungsi kendala dalam model ini sebanyak 12 fungsi meliputi jalur distribusi, waktu pelayanan, dan time windows. Variabel keputusan menentukan terjadinya rute optimal. Formulasi matematis yang telah dirumuskan diselesaikan dengan menggunakan software LINGO 11.0. Jarak dan rute yang didapatkan dari hasil pengolahan data tersebut dibandingkan dengan jarak dan rute existing. Berdasarkan analisis dan perbandingan model existing dengan model mixed integer linear programming, jarak tempuh kendaraan dapat diperpendek sebesar 198.85 km atau 25.4%. Waktu tempuh perjalanan dapat dipercepat selama 298.27 menit atau 25.4%. Biaya distribusi dapat dikurangi sebesar Rp. 888.827 atau 46.4% dalam satu hari pendistribusian. MILP memberikan perbaikan rute dalam cluster-cluster yang terbentuk dalam empat cluster. Dimana pada cluster 1 terdapat 11 retailer, cluster 2 terdapat 11 retailer, cluster 3 terdapat 10 cluster, dan cluster 4 terdapat 9 retailer. Setiap cluster dilayani oleh satu kendaraan untuk melakukan pendistribusian produk tissue.
English Abstract
PT. Graha Kerindo Utama Denpasar is one of the branch office that includes the distribution of tissue products with demand response from various retailers in the region of Bali. In operation of distribution, there is a limit of time frame on retailers with such an attention to working hours (08.00-16.00) the retailer can be served. Currently in determining distribution routes, the company has not been able to optimally plan because it does not consider the aspects of distance between the regions, travel time, and the cost of distribution. This causes to the division of the route that the vehicle currently has been taken is the optimal route. With the determination of this distribution route, will be expected that it would be reduces the mileage, travel time and minimize transportation costs. The distribution problems at PT. Graha Kerindo Utama Denpasar can be solved by using Sweep Algorithm and Mixed Integer Linear Programming (MILP). The number of retailers in this research is distributed in some areas in Bali as many as 40 retailers. Then do the clustering using Sweep Algorithm based on the sequence of the polar angle from a geographical between regions, then followed the settlement of the problem of TSP on each cluster with the exact method, Mixed Integer Linear Programming . In MILP determined the mathematical formulation that includes decision variables, objection function, and constraint function. The objection function is to minimize the mileage of the vehicle. The constraint function in this model as many as 16 functions include distribution lines, time service, and time windows. The decision variables determine the occurance of optimum routes. Mathematical formulations that have been formulated, solved by using LINGO 11.0 software. The result of distance and route is obtained from the data processing compared to the existing route and distance. Based on the analysis and comparison of the existing model with mixed integer linear programming model, mileage of vehicle can be shortened by 198.85 km or 25.4%. Travel time can be accelerated during 298.27 minutes or 25.4%. Distribution costs can be reduced by Rp. 888,827 or 46.4% in one day of distribution. Mixed linear integer programming provides fixed route improvement in clusters-clusters that formed in four clusters. Where in cluster 1 there are 11 retailers, cluster 2 there are 11 retailers, cluster 3 there are 10 clusters, and cluster 4 there are 9 retailers. Each cluster is served by one vehicle to do the distribution of tissue products.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Identification Number: | SKR/FT/2018/6/051800487 |
| Uncontrolled Keywords: | Algoritma Sweep, Mixed Integer Linear Programming, Penentuan Rute Distribusi |
| Subjects: | 000 Computer science, information and general works > 004 Computer science > 004.015 1 Finite mathematic |
| Divisions: | Fakultas Teknik > Teknik Industri |
| Depositing User: | Budi Wahyono Wahyono |
| Date Deposited: | 26 Mar 2018 01:31 |
| Last Modified: | 16 Oct 2021 02:27 |
| URI: | http://repository.ub.ac.id/id/eprint/8917 |
Preview |
Text
BAGIAN DEPAN.pdf Download (274kB) | Preview |
Preview |
Text
BAB I.pdf Download (232kB) | Preview |
Preview |
Text
BAB II.pdf Download (440kB) | Preview |
Preview |
Text
BAB III.pdf Download (105kB) | Preview |
Preview |
Text
BAB IV.pdf Download (1MB) | Preview |
Preview |
Text
BAB V.pdf Download (161kB) | Preview |
Preview |
Text
DAFTAR PUSTAKA.pdf Download (222kB) | Preview |
Actions (login required)
 |
View Item |