Imaduddin, Muhammad Iqbal (2018) Penerapan Algoritma Genetika Hyper-Heuristic Untuk Optimasi Rencana Perjalanan Menggunakan Angkutan Umum Sebagai Sebuah Orienteering Problem : Studi Kasus Bis Kota Di Kota Surabaya. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
05211440000116-Undergraduate_Theses.pdf - Accepted Version Download (2MB) | Preview |
Abstract
Kota Surabaya memiliki beragam tempat yang dapat dikunjungi oleh wisatawan. Mulai dari wisata belanja, wisata religi, taman hiburan, museum, monument, dan tempat-tempat bersejarah. Mayoritas wisatawan yang berkunjung ke Kota Surabaya masih menggunakan kendaraan pribadi sehingga menambah kemacetan di jalan-jalan raya yang ada di Kota Surabaya. Kepadatan ini bisa semakin parah saat akhir pekan maupun saat musim liburan. Padahal untuk mengunjungi tempat-tempat wisata yang ada di Kota Surabaya bisa menggunakan transportasi umum seperti bis kota dan angkot. Pemerintah Kota Surabaya telah berusaha memperbaiki sarana dan layanan transportasi yang beroperasi di Kota Surabaya. Untuk mendukung program milik Pemerintah Kota Surabaya tersebut, maka dalam penelitian ini dilakukan proses optimasi rute perjalanan wisata dengan menggunakan bis kota yang beroperasi setiap hari di Kota Surabaya.
Sebagai studi kasusnya dipilih sepuluh trayek bis kota yang beroperasi di Kota Surabaya. Data waktu tempuh selama perjalanan didapatkan melalui Google Maps. Berdasarkan data tersebut, dibangun sebuah solusi menggunakan Orienteering Problem. Dalam penelitian ini dihasilkan model jejaring dari sepuluh trayek tersebut serta model matematisnya. Solusi optimal dari permasalahan tersebut didapatkan dengan menggunakan Algoritma Genetika Hyper-Heuristic dengan bahasa pemrograman Java.
Untuk percobaan, dilakukan perbandingan hasil pencarian solusi terbaik menggunakan tiga algoritma, yaitu Algoritma Genetika Hyper-Heuristic, Algoritma Genetika, dan Algoritma Genetika Modifikasi. Hasilnya, algoritma genetika hyper-heuristic memberikan solusi nilai fitness sebesar 1125, algoritma genetika sebesar 804 dan algoritma genetika modifikasi sebesar 892. Hasil ini menunjukkan bila algoritma genetika hyper-heuristic memberikan solusi yang lebih baik dibanding dua algoritma lainnya untuk menyelesaikan permasalahan orienteering problem.
===========================================================================================
The city of Surabaya has a variety of places that can be visited by tourists. Starting from shopping center, religious tourism, amusement parks, museums, monuments, and historic places. The majority of tourists who visit the city of Surabaya still use private vehicles that increase the traffic jamming in the existing highways in the city of Surabaya. This density can get worse during weekends or during the holiday season. To visit tourist attractions in the city of Surabaya can use public transportation such as city buses and other public transportations. Surabaya City Government has tried to improve transportation facilities and services that operate in the city of Surabaya. To support the program owned by Surabaya City Government, then in this research is done optimization process of travel route by using city bus that operate daily in Surabaya.
As a case study selected ten city bus routes that operate in the city of Surabaya. Travel time data is obtained through Google Maps. Based on these data, built a solution using the Orienteering Problem. In this study, the network model of the ten routes and mathematical models are produced. The optimal solution of the problem is obtained by using Hyper-Heuristic Genetic Algorithm with Java programming language.
For the experiment, the best results were compared using three algorithms, the Hyper-Heuristic Genetic Algorithm, Genetic Algorithm, and Modified Genetic Algorithm. As a result, the hyper-heuristic genetic algorithm gave solution with 1125 fitness score, genetic algorithm with 804 fitness score and modified genetic algorithm with 892 fitness score. These results suggest that the hyper-heuristic genetic algorithm gave the better solution than the other two algorithms for orienteering problems.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Uncontrolled Keywords: | Transportasi Umum, Orienteering Problem, Optimasi, Algoritma Genetika, Hyper-Heuristic, Public Transportation, Orienteering Problem, Optimization, Genetic Algorithm, transportation route |
| Subjects: | H Social Sciences > HE Transportation and Communications > HE311.I4 Urban transportation H Social Sciences > HE Transportation and Communications > HE336.C5 Choice of transportation H Social Sciences > HE Transportation and Communications > HE336.R68 Route choice Q Science > QA Mathematics > QA76 Computer software Q Science > QA Mathematics > QA76.6 Computer programming. |
| Divisions: | Faculty of Information and Communication Technology > Information Systems > 57201-(S1) Undergraduate Thesis |
| Depositing User: | Muhammad Iqbal Imaduddin |
| Date Deposited: | 22 Oct 2018 07:13 |
| Last Modified: | 12 Mar 2021 11:48 |
| URI: | http://repository.its.ac.id/id/eprint/52737 |
Actions (login required)
 |
View Item |