EUVIMEDEUVIMED entdecken
Open Access · CC BY-SA 4.0

Penerapan Algoritma Dijkstra dalam Optimasi Rute Terpendek dari Stasiun Kereta Api Medan ke Universitas Negeri Medan

Nazwa Salsyabilla Ramadhani, Juliana Gloria Br. Sipayung, Maria Winarni Br Silitonga, Mika Monika Fransiska Simanullang

Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam · 29.05.2026 · 4 (3) · 01-11

DOI: 10.62383/polygon.v4i3.961 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam, online erschienen am 29.05.2026. Verfasst von Nazwa Salsyabilla Ramadhani und 3 weiteren Autor:innen. Der Volltext ist frei zugänglich (Open Access, CC BY-SA 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The increasing complexity of urban transportation systems demands intelligent and measurable navigation methods. Medan City, the capital of North Sumatra Province, has a dense road network with multiple route options that often confuse road users. Dijkstra's Algorithm, developed by Edsger Wybe Dijkstra in 1959, is a greedy-based computational approach proven effective for solving the shortest path problem on non-negative weighted graphs. This study applies Dijkstra's Algorithm to determine the shortest route from Medan Railway Station to Universitas Negeri Medan (UNIMED). The road network was modeled as an undirected weighted graph with 15 nodes and 16 edges, where edge weights represent actual road distances measured via Google Maps. The graph has a density of 0.152, confirming its sparse graph characteristic. Three alternative routes were identified and analyzed. The algorithm was implemented in Python 3 using the heapq module as a priority queue. Results show that the optimal route is A → B → C → E → F → M → N → O via Jl. M.T. Haryono, Jl. Aipda KS Tubun, Jl. Madong Lubis, and Jl. Prof. H.M. Yamin, with a total distance of 6.64 km. This achieves 99.1% accuracy compared to Google Maps, with a deviation of only 0.06 km. The optimal route is 6.25% more efficient than Alternative Route 1 (7.30 km) and 11.9% more efficient than Alternative Route 2 (7.54 km). The algorithm executes in under 1 millisecond with time complexity O((V+E) log V). These findings confirm Dijkstra's Algorithm as highly effective for medium-scale urban road network optimization.

Zitieren

APA

Ramadhani, N. S., Sipayung, J. G. B., Silitonga, M. W. B., & Simanullang, M. M. F. (2026). Penerapan Algoritma Dijkstra dalam Optimasi Rute Terpendek dari Stasiun Kereta Api Medan ke Universitas Negeri Medan. Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam, 4(3), 01-11. https://doi.org/10.62383/polygon.v4i3.961

Vancouver

Ramadhani NS, Sipayung JGB, Silitonga MWB, Simanullang MMF. Penerapan Algoritma Dijkstra dalam Optimasi Rute Terpendek dari Stasiun Kereta Api Medan ke Universitas Negeri Medan. Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam. 2026;4(3):01-11. doi:10.62383/polygon.v4i3.961

BibTeX
@article{Ramadhani2026,
  author = {Ramadhani, Nazwa Salsyabilla and Sipayung, Juliana Gloria Br. and Silitonga, Maria Winarni Br and Simanullang, Mika Monika Fransiska},
  title = {Penerapan Algoritma Dijkstra dalam Optimasi Rute Terpendek dari Stasiun Kereta Api Medan ke Universitas Negeri Medan},
  journal = {Polygon : Jurnal Ilmu Komputer dan Ilmu Pengetahuan Alam},
  year = {2026},
  volume = {4},
  number = {3},
  pages = {01--11},
  doi = {10.62383/polygon.v4i3.961}
}
Kostenlos starten →