Sistem Informasi Navigasi Wisata Kota Jakarta untuk Menentukan Rute Tercepat Menggunakan Algoritma Dijkstra Berbasis Web

  • Syaumi M
  • Noeman A
  • Setiawati S
  • et al.
N/ACitations
Citations of this article
20Readers
Mendeley users who have this article in their library.

Abstract

This study aims to design a web-based tourism navigation information system using Dijkstra’s algorithm to determine the fastest rout in Jakarta City. The proposed navigation system assists tourist in planning their trips more efficiently by providing real-time information on the fastest routes, travel distances, and estimated traviel times. By implementing Dijkstra’s algorithm, the system calculates the optimal route based on the starting location from the user’s device and destination data stored in the database. This research employs the waterfall system development method, which inludes the stages of analysis, design, implementation, and testing. The testing results demonstrate that the system accurately provides the fastest routes, enhancing convenience and travel efficiency for tourist.

Cite

CITATION STYLE

APA

Syaumi, M. R., Noeman, A., Setiawati, S., & Kustanto, P. (2025). Sistem Informasi Navigasi Wisata Kota Jakarta untuk Menentukan Rute Tercepat Menggunakan Algoritma Dijkstra Berbasis Web. Journal of Students‘ Research in Computer Science, 6(1), 35–44. https://doi.org/10.31599/c9by2m49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free