Development of The Nearest Tourism Determination Application using Dijkstra Algorithm
Abstract
By applying information and communication technology, an application can be developed that can help tourists determine the fastest route to reach tourist destinations, to avoid wasting time on trips. This study aims to create a prototype mobile application that can help tourists determine the path with the shortest route to tourist attractions. The research was carried out by using the Dijkstra algorithm and web service to access the tourism database in Bantul Regency, Yogyakarta Special Region as a case study. The fastest route generated by this application is compared to the route suggested by Google Map with a result of 7.24 km and 7.4 km. From the results of these comparisons it can be concluded that the application can determine the closest route from the various alternatives available.
Full Text:
PDFDOI: https://doi.org/10.32535/jicp.v2i1.421
Refbacks
- There are currently no refbacks.
Copyright (c) 2021 Edi Iskandar, Edy Prayitno, Deborah Kurniawati, Al Amin Ali Imron

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Published by:
AIBPM Publisher
Editorial Office:
JL. Kahuripan No. 9 Hotel Sahid Montana, Malang, Indonesia
Phone:+62 341 366222
Email: journal.jicp@gmail.com
Website:http://ejournal.aibpmjournals.com/index.php/JICP
Supported by: Association of International Business & Professional Management
If you are interested to get the journal subscription you can contact us at admin@aibpm.org.
ISSN 2622-0989 (Print)
ISSN 2621-993X (Online)
DOI:Prefix 10.32535 by CrossREF
Journal of International Conference Proceedings (JICP) INDEXED:
In Process
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.