Implementasi Algoritma Greedy dan Djikstra untuk Efektifitas Rute Pariwisata Populer di Borobudur

research
  • 12 Apr
  • 2023

Implementasi Algoritma Greedy dan Djikstra untuk Efektifitas Rute Pariwisata Populer di Borobudur

New tourist attractions in the Borobudur region always bring domestic and foreign tourists to visit. Besides visit the Borobudur Temple, now, the tourists can visit the other popular tourist attractions near the main destination. For example, in 2019, a new tourist attraction was created, it called Mata Langit. Many tourists will include all the interest object on the visit list. The more destinations that will be visited will increase the allocation of time to travel. Tourists must be careful in determining the route.  The effective route is very important to manage the time. In the field of computer technology, several algorithms can help to determine the shortest route. Among them are the Greedy algorithm and Djikstra's algorithm. Both algorithms have different principles in processing data. Therefore to get the best results, it is necessary to compare the 2 algorithms. The first time, determined the 5 most popular attractions in Borobudur based on the number of visitors in the last three months. Then the data is processed using Greedy and Djikstra's algorithm. The winner is determined based on the shortest time owned by each route produced. The results obtained show that the Greedy algorithm is more effective in calculating the shortest route to visit popular tours in Borobudur

Unduhan

 

REFERENSI

[1] Y. D. Mahendra, N. Nuryanto, and A. Burhanuddin, “Sistem Penentuan Jarak Terdekat Dalam Pengiriman Darah Di Pmi Kota Semarang Dengan Metode Algoritma Greedy,” J. Komtika, vol. 2, no. 2, pp. 136 –142, 2019.
[2] R. B. Oktaviandi, M. S. T. Hadi, A. G. Santoso, and N. El Maidah, “Perbandingan Algoritma Genetika dengan Algoritma Greedy Untuk Pencarian Rute Terpendek,” INFORMAL Informatics J., vol. 3, no. 1, p. 6, 2019.
[3] M. Ammar, “Implementasi Algoritma Greedy Dalam Menyelesaikan Knapsack Problem Pada Jasa Pengiriman PT. Citra Van Titipan Kilat (TIKI) Kota Makassar,” Axiomat. J. Mat. dan Apl., vol. 1, no. September, pp. 26 – 32, 2019.
[4] L. Affandi, R. Rismanto, and M. M. Firmansyah, “Aplikasi pengiriman pesanan makanan menggunakan algoritma djikstra,” Tugas AKhir, pp. 1–10, 2017.
[5] P. S. Juwita, J. Halomoan, F. T. Elektro, and U. Telkom, “Menggunakan Algoritma Greedy Untuk Otomatisasi Rumah Design and Implementation of Power Management Using Greedy,” vol. 4, no. 2, pp. 1512 – 1519, 2017.
[6] M. S. Yusuf, H. M. Az-zahra, and D. H. Apriyanti, “Implementasi Algoritma Dijkstra Dalam Menemukan Jarak Terdekat Dari Implementasi Algoritma Dijkstra Dalam Menemukan Jarak Terdekat Dari Lokasi Pengguna Ke Tanaman Yang Di Tuju BerbasisAndroid (  Studi Kasus di Kebun Raya Purwodadi ),” J. Pengemb. Teknol. Inf. dan Ilmu Komput., vol. 1, no. August, pp. 1779 –1781, 2017.
[7] R. T. Shita and F. Tarigan, “Implementasi Algoritma Djikstra untuk menentukan Jarak Terdekat Pencarian outlet Minimal Store berbasis Android pada Area Jabodetabek,” vol. 6, no. 3, pp. 140-146, 2018.
[8] D. Silvi and P. Dwiza, “Promosi Marketing Menggunakan Algoritma Genetika Dan,” Informatika, vol. 3, no. September, pp. 299–313, 2016.
[9] Y. Darnita and R. Toyib, “Penerapan Algoritma Greedy Dalam Pencarian Jalur Terpendek Pada Instansi-Instasi Penting Di Kota Argamakmur Kabupaten Bengkulu Utara,” vol. 15, no. 2, 2019.
[10] J. V. Ginting and E. S. Barus, “Aplikasi Penentuan Rute Rumah Sakit Terdekat Menggunakan Algoritma Dijkstra,” J. Mantik Penusa, vol. 2, no. 2, pp. 1–8,2018.
[11] R. Dwi, Saputra and Ardana, “Penerapan Algoritma Dijkstra pada Aplikasi Pencarian Rute Bus Trans Semarang,” Skripsi Jur. Ilmu Komputer, Fak. Sains Dan Mat. Univ. Diponegoro, no. Snik, pp. 299–
306, 2016.
[12] C. V. Esanata and F. T. Industri, “Penerapan metode djikstra sebagai penentuan rute terpendek distribusi pengiriman kantor jne pusat kabupaten jombang,” vol.3, no. 1, pp. 79 –84, 2019.
[13] A. Z. Hasibuan, “Penentuan Alur TerpendekzPengiriman Barang PT.Kencana Link Nusantara Medan Dengan Algoritma Djikstra,” J. Ris. Komput.,vol. 3, no. 6, pp. 14– 19, 2016.
[14] Risald, A. E. Mirino, and Suyoto, “Best routes selection using Dijkstra and Floyd - Warshall algorithm,” Proc. 11th Int. Conf. Inf. Commun. Technol. Syst. ICTS 2017, vol. 2018 - January, no. October, pp. 155 – 158, 2018, doi:10.1109/ICTS.2017.8265662.
[15] Y. Zhang, Y. Su, J. Yang, J. Ponce, and H. Kong, “When dijkstra meets vanishing point: A stereo vision approach for road detection,” IEEE Trans. Image Process., vol. 27, no. 5, pp. 2176 –2188, 2018, doi:10.1109/TIP.2018.2792910
.
 
 

Cari

Bidang Ilmu

Kategori

Kiriman Terbaru