Raditya, Pande Made Rai (2017) Optimasi Multiple Travelling Salesman Problem (M-Tsp) Pada Penentuan Rute Optimal Penjemputan Penumpang Travel Menggunakan Algoritme Genetika. Sarjana thesis, Universitas Brawijaya.
Abstract
Antusias penumpang menggunakan jasa travel dapat dilihat dengan semakin banyaknya perusahaan- perusahaan travel yang mudah dijumpai di setiap kota. Kota Malang merupakan daerah yang penduduknya cukup padat dikarenakan jumlah mahasiswa yang banyak, begitu juga dengan mahasiswa yang berasal dari luar kota. Hal inilah yang membuat semakin banyaknya jasa travel di kota Malang. Penentuan rute optimal merupakan suatu masalah yang sangat penting untuk dipecahkan karena berpengaruh terhadap waktu dan biaya operasional kendaraan. Pada penelitian ini, optimasi penentuan rute optimal untuk beberapa mobil travel dimulai dari kantor travel menuju ke alamat penjemputan masing-masing penumpang. Permasalahan tersebut termasuk kedalam permasalahan Multi Travelling Salesman Problem (M-TSP) dan salah satu algoritme untuk menyelesaikan permasalahan M-TSP ialah dengan algoritme genetika. Pada permasalahan ini menggunakan representasi permutasi, proses reproduksi crossover dengan one cut point crossover, proses mutasi dengan exchange mutation, dan proses seleksi dengan elitism selection. Setelah melakukan uji coba dengan menggunakan 30 lokasi, didapatkan hasil parameter yang paling optimal yaitu pada populasi dengan ukuran populasi 80, dengan jumlah mobil travel sebanyak 6, generasi sebesar 450, nilai cr sebesar 0.6 dan mr sebesar 0.4. Hasil dari program dengan parameter tersebut menghasilkan rata-rata nilai fitness terbesar yaitu 8.09338.
English Abstract
Passengers enthusiasm in using travel services can be figured out through the increasing number of travel companies that are easily found in every city. Malang city is a region where the population is quite crowded with the large number of students, as well as students who come from outside the city. This makes more and more travel services emerge in Malang. Optimal route determination is a very notable problem to solve because it influences the time and operational costs of the vehicle. In this study, optimization of the optimal route determination for some travel cars starts from the travel office to the address of picking up each passenger. These problems belong to the problem of Multi Traveling Salesman Problem (M-TSP) and one of the algorithms to solve the M-TSP problem is by using genetic algorithm. In this case, it is used permutation representation, crossover reproduction process by one cut point crossover, mutation process by exchange mutation, and selection process by elitism selection. After conducting trials by using 30 locations, it is obtained that the results of the most optimal parameters is in the population which the population size is 80, with the number of cars traveling is 6, 450 generations, 0.6 and mr 0.4 and 0.4. The results of the program with these parameters resulted in the highest average fitness value of 8.09338.
| Item Type: | Thesis (Sarjana) |
|---|---|
| Identification Number: | SKR/FTIK/2017/828/051800985 |
| Uncontrolled Keywords: | optimasi, penentuan rute, penumpang travel, multi travelling salesman problem, algoritme genetika optimization, route determination,travel passangers, multi travelling salesman problem, genetic algorithm |
| Subjects: | 300 Social sciences > 388 Transportation > 388.04 Special topics of transportation > 388.041 Activities and services |
| Divisions: | Fakultas Ilmu Komputer > Teknik Informatika |
| Depositing User: | Budi Wahyono Wahyono |
| Date Deposited: | 02 Apr 2019 03:16 |
| Last Modified: | 16 Oct 2021 02:48 |
| URI: | http://repository.ub.ac.id/id/eprint/161370 |
Preview |
Text
Pande Made Rai Raditya.pdf Download (16MB) | Preview |
Actions (login required)
 |
View Item |