Pemodelan Sistem Pemilihan Tempat POI Terdekat di Wilayah Klaten Kota Menggunakan Metode Dijkstra oleh PT. Telkom Klaten
DOI:
https://doi.org/10.35870/jtik.v9i1.3063Keywords:
POI, Djikstra Algorithm, Survey, Distance, GraphAbstract
The Point of Interest (POI) represents a specific geographic location defined by its coordinates, including longitude and latitude, and holds value as a site of interest or utility. Examples of POIs include tourist attractions, hotels, restaurants, ATMs, pharmacies, health centers, retail shops, gas stations, and other categories integral to modern navigation systems. PT. Telkom Klaten has faced increased demands to conduct POI surveys efficiently, driven by advancements in technology that call for faster and more streamlined processes. A primary challenge in these surveys is the selection of an optimal route that minimizes time, costs, and fuel consumption, given that the company currently relies on manual input in Google Maps to determine distance and travel time. This manual approach may hinder survey efficiency and increase operational costs. To address this, an application employing the Dijkstra algorithm was developed to determine the shortest route effectively. The Dijkstra algorithm, known for selecting edges with minimal weight to connect sequential nodes, requires defined origin and destination points, thereby generating the most efficient route between them. This study applies the Dijkstra algorithm to optimize survey routes by modeling them as graph-based routes, aiming to identify the shortest and most efficient paths between multiple POI locations. The findings indicate that the Dijkstra algorithm significantly reduces travel distance and time, thereby achieving notable savings in fuel and operational time for POI surveys.
Downloads
References
Adi, N. H., Giatman, M., Simatupang, W., Afrina, A., & Watrianthos, R. (2021). Penerapan metode Dijkstra pada jalur distribusi LPG untuk penentuan jarak terpendek. Building of Informatics, Technology and Science (BITS), 3(3), 235-243. DOI: https://doi.org/10.47065/bits.v3i3.1052.
Dijkstra, E. W. (2022). A note on two problems in connexion with graphs. In Edsger Wybe Dijkstra: his life, work, and legacy (pp. 287-290).
Gunawan, G., Andriani, W., & Munfi, K. H. (2023). Application of the dijkstra method in finding the shortest route for hospitals in Kabupaten Tegal. Jurnal Mandiri IT, 12(2), 97-105. DOI: https://doi.org/10.35335/mandiri.v12i2.238.
Guo, Q., He, Z., Wang, Z., Qiao, S., Zhu, J., & Chen, J. (2024). A Performance Comparison Study on Climate Prediction in Weifang City Using Different Deep Learning Models. Water, 16(19), 2870.
Inayah, A. M., Resti, N. C., & Ilmiyah, N. F. (2023). Analisa perbandingan algoritma floyd-warshall dan algoritma dijkstra untuk penentuan rute terdekat. Jurnal Ilmiah Matematika Realistik, 4(2), 146-155.
Kimani, C. J., & Scott, J. (2023). Introduction to Algorithms Professional Level. Finstock Evarsity Publishers.
Liu, J., Wang, X., Lin, H., & Yu, F. (2023). GSAA: A Novel Graph Spatiotemporal Attention Algorithm for Smart City Traffic Prediction. ACM Transactions on Sensor Networks.
Mustafayev, M. A. (2024). Implementation of shortest route algorithms in Smart City (Doctoral dissertation).
Nurhasanah, F. Y., Gata, W., Riana, D., Jamil, M., & Saputra, S. F. (2021). Shortest path finding using dijkstra’s algorithm. PIKSEL: Penelitian Ilmu Komputer Sistem Embedded and Logic, 9(1), 89-102. DOI: https://doi.org/10.33558/piksel.v9i1.2365.
Rochman, A., Sidik, A., & Nazahah, N. (2018). Perancangan sistem informasi administrasi pembayaran SPP siswa berbasis web di SMK Al-Amanah. Jurnal Sisfotek Global, 8(1), 51-56.
Sari, I. P., Fahroza, M. F., Mufit, M. I., & Qathrunad, I. F. (2021). Implementation of Dijkstra's Algorithm to Determine the Shortest Route in a City. Journal of Computer Science, Information Technology and Telecommunication Engineering, 2(1), 134-138.
Widiatmoko, M. E. (2021). KOMPOSISI RULE OF THIRD DAN POINT OF INTEREST PADA HASIL KARYA FOTO ENARA FOTOGRAFI. JISyCS (Journal Of Information System And Computer Science), 1(2), 40-51.
Wita, D. S. (2022). Implementasi Algoritma Dijkstra Untuk Penentuan Rute Terpendek Puskesmas Di Samarinda. Inspiration: Jurnal Teknologi Informasi Dan Komunikasi, 12(1), 88-95.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Erlina Kumala Kusumawati, Dwi Hartanti, Tri Djoko Santosa
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Authors who publish with this journal agree to the following terms:
1. Copyright Retention and Open Access License
Authors retain copyright of their work and grant the journal non-exclusive right of first publication under the Creative Commons Attribution 4.0 International License (CC BY 4.0).
This license allows unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
2. Rights Granted Under CC BY 4.0
Under this license, readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material for any purpose, including commercial use
- No additional restrictions — the licensor cannot revoke these freedoms as long as license terms are followed
3. Attribution Requirements
All uses must include:
- Proper citation of the original work
- Link to the Creative Commons license
- Indication if changes were made to the original work
- No suggestion that the licensor endorses the user or their use
4. Additional Distribution Rights
Authors may:
- Deposit the published version in institutional repositories
- Share through academic social networks
- Include in books, monographs, or other publications
- Post on personal or institutional websites
Requirement: All additional distributions must maintain the CC BY 4.0 license and proper attribution.
5. Self-Archiving and Pre-Print Sharing
Authors are encouraged to:
- Share pre-prints and post-prints online
- Deposit in subject-specific repositories (e.g., arXiv, bioRxiv)
- Engage in scholarly communication throughout the publication process
6. Open Access Commitment
This journal provides immediate open access to all content, supporting the global exchange of knowledge without financial, legal, or technical barriers.
