Authors:

Wahyu Ramadhan, I Gede Santi Astawa, Luh Gede Astuti, Luh Arida Ayu Rahning Putri, I Putu Gede Hendra Suputra, I Wayan Santiyasa

Abstract:

“The closest route optimization problem is a classic problem that is still often found in everyday life, one of them is the Traveling Salesman Problem (TSP). This study aims to find solutions in the form of optimal distances to various tourist destinations in Banyuwangi. In this study, the author uses the Python programming language as the backend and the Kotlin programming language as the frontend of the Android application as part of Modern Android Development. The results of the system evaluation, namely Black Box and User Acceptance Test on the application, show that the system that has been carried out can be concluded that the functional system can work well without experiencing bugs or problems on every available feature and page. In designing the application, the author uses the Modern Android Development pattern.”

Keywords

Keyword Not Available

Downloads:

Download data is not yet available.

References

References Not Available

PDF:

https://jurnal.harianregional.com/jlk/full-88936

Published

2022-07-14

How To Cite

RAMADHAN, Wahyu et al. Pengembangan Aplikasi Optimasi Rute Destinasi Wisata di Banyuwangi Menggunakan Modern Android Development (MAD) Pattern.JELIKU (Jurnal Elektronik Ilmu Komputer Udayana), [S.l.], v. 11, n. 2, p. 369-378, july 2022. ISSN 2654-5101. Available at: https://ojs.unud.ac.id/index.php/JLK/article/view/88936. Date accessed: 28 Aug. 2025. doi:https://doi.org/10.24843/JLK.2022.v11.i02.p16.

Citation Format

ABNT, APA, BibTeX, CBE, EndNote - EndNote format (Macintosh & Windows), MLA, ProCite - RIS format (Macintosh & Windows), RefWorks, Reference Manager - RIS format (Windows only), Turabian

Issue

Vol 11 No 2 (2022): JELIKU Volume 11 No 2, November 2022

Section

Articles

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License