Al Aziz, Achmad Wildan (2019) Optimasi Distribusi Bahan Bakar Minyak ke SPBU Menggunakan Optimasi Metaheuristik. Other thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
06211440000082-Undergraduate_Theses.pdf - Accepted Version Download (1MB) | Preview |
Abstract
Penyaluran Bahan Bakar Minyak (BBM) harus efisien dan ekonomis baik dari segi waktu maupun biaya. Kendala yang biasa dihadapi dalam penyaluran bahan bakar dari tempat satu ke tempat lainnya yakni letak geografis yang cukup jauh. Biaya distribusi merupakan salah satu komponen dalam perumusan harga keekonomian yang ditetapkan oleh Badan Pengatur Hilir Minyak dan Gas Bumi. Permasalahan untuk mendapatkan rute distribusi BBM menjadi semakin rumit. Vehicle Routing Problem (VRP) dikembangkan untuk mempelajari bagaimana mendapatkan jalur distribusi BBM terpendek. Metode optimasi metaheuristik yang digunakan dalam penyelesaian VRP dan terbukti mampu menemukan solusi dengan baik dan cepat serta efisien dalam menyelesaikan masalah rute terpendek. Penelitian ini akan menyelesaikan VRP dengan metode optimasi metaheuristik Genetic Algorithm dan Simulated Annealing. Metode simulated annealing mendapatkan hasil rute terpendek dengan waktu tempuh 1019 menit, sedangkan metode genetic algorithm mendapatkan rute terpendek 1208 menit. Waktu pencarian rute yang dibutuhkan oleh metode simulated annealing sekitar 0,442 detik, sedangkan metode genetic algorithm selama 2,03 detik. Dengan demikian pada penelitiann ini metode simulated annealing lebih baik daripada genetic algorithm baik dari segi hasil optimasi rute terpendek dan waktu pencarian rute.
================================================================================================
Distribution of fuel must be efficient and economical both in terms of time and cost. Constraints that are usually faced in the distribution of fuel from one place to another, which is quite a geographical location. Distribution costs are one component in the formulation of economic prices set by BPH-Migas. The problem of getting fuel distribution routes is becoming increasingly complex. Vehicle Routing Problem (VRP) was developed to learn how to get the shortest distribution path. Metaheuristic optimization method used in VRP completion and proven to be able to find a solution well and fast, and efficiently in solving the shortest route problem. This study will complete VRP with metaheuristic optimization method Genetic Algorithm and Simulated Annealing. The simulated annealing method gets the shortest route with a travel time of 1019 minutes, while the genetic algorithm method gets the shortest route 1208 minutes. The route search time needed by the simulated annealing method is around 0.442 seconds, while the genetic algorithm method is 2.03 seconds. Thus in this study the simulated annealing method is better than genetic algorithm both in terms of the optimization results of the shortest route and route search time.
| Item Type: | Thesis (Other) |
|---|---|
| Additional Information: | RSSt 658.8 Azi o-1 2019 |
| Uncontrolled Keywords: | Vehicle Routing Problem, Fuel, Genetic Algorithm, Simulated Annealing, Metaheuristics. |
| Subjects: | Q Science Q Science > QA Mathematics > QA273.6 Weibull distribution. Logistic distribution. Q Science > QA Mathematics > QA402.5 Genetic algorithms. Interior-point methods. |
| Divisions: | Faculty of Mathematics, Computation, and Data Science > Statistics > 49201-(S1) Undergraduate Thesis |
| Depositing User: | Achmad Wildan Al Aziz |
| Date Deposited: | 23 Jul 2021 04:29 |
| Last Modified: | 23 Mar 2023 12:22 |
| URI: | http://repository.its.ac.id/id/eprint/61045 |
Actions (login required)
 |
View Item |