Anshori, Dinah Razan (2019) Optimasi Vehicle Routing Problem With Time Windows (VRPTW) Pada Distribusi Kue Menggunakan Algoritma Genetika. Other thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
06111440000032_undergraduate_theses.pdf Download (6MB) | Preview |
Abstract
Dalam pendistribusian suatu produk perlu mempertimbangkan beberapa faktor antara lain waktu, jarak tempuh, biaya transportasi, serta rute yang akan dilalui dari satu tempat ke tempat yang lainnya. Pada tugas akhir ini, pendistribusian kue industri rumah tangga “Matoh Tenan” ke beberapa toko kue menggunakan konsep Vehicle Routing Problem (VRP) yang bertujuan untuk meminimalkan jarak, dengan memperhatikan time window setiap toko kue yang berbeda-beda. Untuk mengatasi permasalahan tersebut diperlukan suatu metode yang dapat mengoptimalkan jarak tempuh dari suatu tempat ke tempat lain dengan memperhatikan time window. Algoritma genetika menawarkan suatu solusi pemecahan masalah yang tebaik untuk permasalahan VRP. Dari hasil pengujian ukuran populasi terbaik adalah 150 populasi, sedangkan untuk kombinasi probabilitas crossover dan mutasi adalah 0,2 dan 0,7. Dari nilai-nilai parameter ini didapatkan rute optimal yaitu dari lokasi titik awal rute kendaraan 1: 9 → 3 → 5 → 6 → 10 → 4 → 12, rute kendaraan 2: 1 → 18 → 24 → 11 → 20 → 23 → 13, rute kendaraan 3: 26 → 7 → 14 → 25 → 21 → 19, rute kendaraan 4: 2 → 8 → 22 → 17 → 16 → 15 dengan nilai fitness sebesar 0,0160 dan jarak tempuh dari total perjalanan oleh 4 kendaraan yaitu 62,31 km.
=================================================================================================================================
In the distribution of a product it is necessary to consider several factors including time, distance traveled, transportation costs, and routes to be traveled from one place to another. In this final project the cake distribution of home industry "Matoh Tenan" to a several of cake shops using the concept of Vehicle Routing Problem (VRP) which aims to minimize the distance, by taking notice of the different windows of each problem. To overcome this problem, we need a method that can optimize the distance from one place to another by taking notice to the time window. Genetic algorithms offer the best solution for VRP problems. From the results of testing the best population size is 150 populations, while for combinations of crossover and mutation probabilities are 0.2 and 0.7. From these parameter values the optimal route is obtained from the location of the starting point of the vehicle route 1: 9 → 3 → 5 → 6 → 10 → 4 → 12, vehicle route 2: 1 → 18 → 24 → 11 → 20 → 23 → 13, vehicle route 3: 26 → 7 → 14 → 25 → 21 → 19, vehicle route 4: 2 → 8 → 22 → 17 → 16 → 15 with a fitness value of 0.0160 and the distance traveled from the total trip by 4 vehicles, which is 62.31 km.
| Item Type: | Thesis (Other) |
|---|---|
| Additional Information: | RSMa 005.1 Ans o-1 2019 |
| Uncontrolled Keywords: | distribusi, rute optimal, VRP, time window, algoritma genetika |
| Subjects: | Q Science > QA Mathematics > QA402.5 Genetic algorithms. Interior-point methods. Q Science > QA Mathematics > QA9.58 Algorithms |
| Divisions: | Faculty of Mathematics, Computation, and Data Science > Mathematics > 44201-(S1) Undergraduate Thesis |
| Depositing User: | Dinah Razan Anshori |
| Date Deposited: | 02 Apr 2024 03:34 |
| Last Modified: | 02 Apr 2024 03:34 |
| URI: | http://repository.its.ac.id/id/eprint/66168 |
Actions (login required)
 |
View Item |