OPTIMALISASI RUTE WISATA DI YOGYAKARTA MENGGUNAKAN METODE TRAVELLING SALESMAN PERSON DAN ALGORITMA BRUTE FORCE

Authors

  • Condro Wibawa Universitas Gunadarma

DOI:

https://doi.org/10.56127/jts.v1i3.512

Keywords:

travelling salesman person, brute force algorithm, graph

Abstract

Yogyakarta is one of the popular tourist destinations in Indonesia. There are many tourist sites that can be visited in the city of Yogyakarta, including Prambanan Temple, Breksi Cliff, Van den Berg Museum, and Malioboro. For tourists who are not familiar with these tourist sites, determining the route to be visited is important because it will affect travel costs, especially transportation costs. To solve this problem, the Traveling Salesman Person method and the Brute Force Algorithm are used. The Brute Force algorithm was chosen because of its simple characteristics so that it is easy for all people to understand. The results of the research resulted in the most optimal route with a total cost of Rp. 100,300.00 and the least optimal route with a total cost of Rp. 131,000.00.

References

Verenca Laila Okta, Muhammad Afif , Faisal Rautomo, “Implementasi Pendekatan Brute Force pada Penyusunan Jadwal Perjalanan Wisata Otomatis dengan Kombinasi Knapsack-Travelling Salesman Person”, Seminar Informatika Aplikatif Polinema (SIAP), 2020.

Augridita Prawidya , Bambang Pramono, L.M Bahtiar Aksar, “Travelling Salesman Problem untuk Menentukan Rute Terpendek Bagi Kurir Kota Kendari Menggunakan Algoritma Greedy Berbasis Android”, Jurnal Jurusan Teknik Informatika, Fakultas Teknik Universitas Halu Oleo, Kendari , 3(1), 95-106, 2020.

Munir, Rinaldi, “Algoritma Brute Force”. Institut Teknologi Bandung, 2014.

Widia Santoso, Bayu, Sundawa, Firdiansyah, Azhari, Muhammad, "Implementasi Algoritma Brute Force Sebagai Mesin Pencari (Search Engine) Berbasis Web Pada Database", Jurnal Sisfotek Global ISSN : 2088 – 1762 Vol. 6 No. 1, 2016.

Candra Irawan, Mudafiq Riyan Pratama, , “Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android”. Jurnal Teknologi Informasi dan Rekayasa Komputer, 2(1), 54-60, 2020.

Sinaga, Aditya, Nuraisana, "Implementasi Algoritma Brute Force Dalam Pencarian Menu Pada Aplikasi Pemesanan Coffee (Studi Kasus : Tanamera Coffee)", JIKOMSI [Jurnal Ilmu Komputer dan Sistem Informasi] E-ISSN : 2723-6129 Vol.4 No.1, pp 6-15, 2021.

T.R. Alfin, H.S. Indyah, K. Sabitul, "Penerapan Algoritma Brute Force Pada Aplikasi Sidayko Berbasis Android", Jurnal MNEMONIC, Vol 5, No 1, 2022.

A.Septi, Andrianingsih, F. Naif, "Penerapan Algoritma A-star dan Brute Force pada Aplikasi Jakvel (Jakarta Travel) Berbasis Android", Jurnal Media Informatika Budidarma, Vol 5, No 3, 2021.

Wilson, Yuliant, Izzatul, "Analisis Penyelesaian Traveling Salesman Problem Dengan Metode Brute Force Menggunakan Graphic Processing Unit", e-Proceeding of Engineering, Vol 2, hal 1875-1876, 2015.

Published

2022-10-30

How to Cite

Condro Wibawa. (2022). OPTIMALISASI RUTE WISATA DI YOGYAKARTA MENGGUNAKAN METODE TRAVELLING SALESMAN PERSON DAN ALGORITMA BRUTE FORCE. Jurnal Teknik Dan Science, 1(3), 59–65. https://doi.org/10.56127/jts.v1i3.512

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.