Wiradharma, Putu Panji (2026) Advance Traveler Information System: Optimasi Rencana Perjalan Berdasarkan Preferensi Dengan Model Orienteering Problem Dan Memetic Algorithm (Studi Kasus: Objek Wisata & Kuliner Di Bali). Other thesis, Institut Teknologi Sepuluh Nopember.
![[thumbnail of 5026221170-Undergraduate_Thesis.pdf]](http://repository.its.ac.id/style/images/fileicons/text.png) |
Text
5026221170-Undergraduate_Thesis.pdf - Accepted Version Restricted to Repository staff only Download (1MB) | Request a copy |
Abstract
Pariwisata Bali menawarkan beragam pilihan destinasi wisata dan kuliner yang menarik, namun keterbatasan waktu menyebabkan wisatawan tidak dapat mengunjungi seluruh destinasi yang diinginkan. Permasalahan tersebut dapat dimodelkan sebagai Orienteering Problem (OP), yaitu permasalahan optimasi yang bertujuan memaksimalkan nilai kunjungan dengan memperhatikan berbagai batasan perjalanan. Penelitian ini bertujuan untuk merancang model matematis OP yang mengakomodasi preferensi wisata dan kuliner wisatawan, mengembangkan Memetic Algorithm (MA) sebagai metode optimasi, serta membandingkan kinerjanya dengan Local Search (LS) dan Genetic Algorithm (GA). Model yang dikembangkan mempertimbangkan preferensi pengguna, batas waktu perjalanan harian, jam operasional destinasi, jumlah kunjungan tempat makan, jeda waktu makan, serta hotel sebagai titik awal dan akhir perjalanan. Selain itu, penelitian ini juga mengembangkan prototipe website berbasis Advance Traveler Information System (ATIS) untuk memvisualisasikan hasil rekomendasi itinerary. Berdasarkan hasil pengujian, seluruh skenario uji fungsional berhasil memenuhi seluruh constraint yang telah ditetapkan pada model matematis. Hasil pengujian kinerja menunjukkan bahwa Memetic Algorithm memberikan performa terbaik dengan nilai fitness rata-rata sebesar 82,0876, jumlah destinasi yang berhasil dikunjungi rata-rata sebanyak 22 destinasi, serta konsistensi hasil yang lebih baik dibandingkan LS dan GA. Hasil penelitian menunjukkan bahwa kombinasi mekanisme evolusi pada GA dengan proses local search mampu menghasilkan kualitas solusi yang lebih baik dalam permasalahan optimasi rute wisata berbasis preferensi di Bali.
=======================================================================================================================================
Bali tourism offers a wide variety of tourist attractions and culinary destinations. However, limited travel time prevents tourists from visiting all desired locations, making itinerary planning a suitable application of the Orienteering Problem (OP). This study aims to develop a mathematical model of the OP that accommodates tourists travel and culinary preferences, implement a Memetic Algorithm (MA) as the optimization method, and compare its performance with Local Search (LS) and Genetic Algorithm (GA). The proposed model considers user preferences, daily travel time limits, destination operating hours, the number of restaurant visits, meal interval constraints, and the hotel as the starting and ending point of each daily route. In addition, a prototype website based on an Advance Traveler Information System (ATIS) was developed to visualize the recommended itineraries. Functional testing demonstrated that all generated itineraries satisfied every constraint defined in the mathematical model. Performance evaluation showed that the Memetic Algorithm achieved the best results, obtaining an average fitness value of 82.0876, visiting an average of 22 destinations, and producing more consistent solutions than both LS and GA. These findings indicate that combining the evolutionary mechanism of GA with local search intensification effectively improves solution quality for preference-based tourism route optimization in Bali.
| Item Type: | Thesis (Other) |
|---|---|
| Uncontrolled Keywords: | Orienteering Problem, Memetic Algorithm, Advance Traveler Information System, Optimasi Rute Wisata, Smart Tourism, Orienteering Problem, Tourism Route Optimization |
| Subjects: | H Social Sciences > HE Transportation and Communications > HE311.I4 Urban transportation T Technology > T Technology (General) > T57.84 Heuristic algorithms. |
| Divisions: | Faculty of Intelligent Electrical and Informatics Technology (ELECTICS) > Information System > 57201-(S1) Undergraduate Thesis |
| Depositing User: | Putu Panji Wiradharma |
| Date Deposited: | 29 Jul 2026 03:13 |
| Last Modified: | 29 Jul 2026 03:13 |
| URI: | http://repository.its.ac.id/id/eprint/139319 |
Actions (login required)
 |
View Item |