Arifuddin, Akhdan (2022) Penyelesaian Masalah Capacitated Vehicle Routing Problem (Cvrp) Pada Pt. Petrokimia Gresik. Other thesis, Institut Teknologi Sepuluh Nopember.
![[thumbnail of 05211840000117-Undergraduate_Thesis.pdf]](http://repository.its.ac.id/style/images/fileicons/text.png) |
Text
05211840000117-Undergraduate_Thesis.pdf Restricted to Repository staff only Download (3MB) | Request a copy |
Abstract
PT. Petrokimia Gresik merupakan perusahaan yang bergerak di bidang produksi pupuk dan bahan kimia lainnya. Dalam pendistribusian pupuk, PT. Petrokimia Gresik menghadapi masalah dalam menentukan rute pengiriman yang optimal. Permasalahan ini dikenal sebagai Capacitated Vehicle Routing Problem (CVRP), yaitu masalah penentuan rute kendaraan dengan kapasitas terbatas untuk melayani sejumlah pelanggan dengan total permintaan tidak melebihi kapasitas kendaraan. Tujuan dari tugas akhir ini adalah untuk menyelesaikan masalah CVRP pada PT. Petrokimia Gresik untuk meminimalkan total jarak tempuh pengiriman pupuk. Metode yang digunakan adalah algoritma Clarke and Wright Savings dan algoritma Genetika. Algoritma Clarke and Wright Savings digunakan untuk mendapatkan solusi awal, kemudian algoritma Genetika digunakan untuk memperbaiki solusi tersebut. Hasil dari penelitian ini menunjukkan bahwa algoritma Genetika dapat menghasilkan solusi yang lebih baik dibandingkan dengan algoritma Clarke and Wright Savings. Total jarak tempuh yang dihasilkan dengan algoritma Genetika adalah 158 km, sedangkan dengan algoritma Clarke and Wright Savings adalah 172 km. Penghematan jarak yang diperoleh adalah sebesar 8,14%.
==============================================================================================================================
PT. Petrokimia Gresik is a company engaged in the production of fertilizers and other chemicals. In distributing fertilizer, PT. Petrokimia Gresik faces problems in determining the optimal delivery route. This problem is known as the Capacitated Vehicle Routing Problem (CVRP), which is the problem of determining routes for vehicles with limited capacity to serve a number of customers with a total demand that does not exceed the vehicle's capacity. The purpose of this final project is to solve the CVRP problem at PT. Petrokimia Gresik to minimize the total delivery distance of fertilizer. The methods used are the Clarke and Wright Savings algorithm and the Genetic algorithm. The Clarke and Wright Savings algorithm is used to obtain an initial solution, then the Genetic algorithm is used to improve the solution. The results of this study indicate that the Genetic algorithm can produce better solutions compared to the Clarke and Wright Savings algorithm. The total distance traveled resulting from the Genetic algorithm is 158 km, while the Clarke and Wright Savings algorithm is 172 km. The distance savings obtained are 8.14%.
| Item Type: | Thesis (Other) |
|---|---|
| Additional Information: | RSSI 658.78 Ari p-1 2022 |
| Uncontrolled Keywords: | Capacitated Vehicle Routing Problem. Algoritma Genetika. |
| Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD30.213 Management information systems. Dashboards. Enterprise resource planning. |
| Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Information System > 57201-(S1) Undergraduate Thesis |
| Depositing User: | Mr. Marsudiyana - |
| Date Deposited: | 04 Jun 2026 06:22 |
| Last Modified: | 04 Jun 2026 06:22 |
| URI: | http://repository.its.ac.id/id/eprint/133563 |
Actions (login required)
 |
View Item |