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

Authors

  • Muhammad Rizki Syaumi Universitas Bhayangkara Jakarta Raya
  • Achmad Noeman Universitas Bhayangkara Jakarta Raya
  • Siti Setiawati Universitas Bhayangkara Jakarta Raya
  • Prio Kustanto Universitas Bhayangkara Jakarta Raya

DOI:

https://doi.org/10.31599/c9by2m49

Keywords:

Dijkstra’s Algorithm, Fastest Route, Jakarta City Tourism, Navigation System, Web-Based System

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.

Downloads

Download data is not yet available.

Downloads

Published

2025-05-30

Issue

Section

Articles

How to Cite

Sistem Informasi Navigasi Wisata Kota Jakarta untuk Menentukan Rute Tercepat Menggunakan Algoritma Dijkstra Berbasis Web. (2025). Journal of Students‘ Research in Computer Science, 6(1), 35-44. https://doi.org/10.31599/c9by2m49