Penerapan Algoritma Dijkstra Dinamis Berbasis Real-Time Traffic Data untuk Efisiensi Perjalanan Lintas Tengah Sumatra (Studi Kasus: Binjai – Padangsidimpuan)

Ade Linhar P* -  UIN Syekh Ali Hasan Ahmad Addary Padangsidimpuan, Indonesia
Rafi Septiawan Putra -  UIN Syekh Ali Hasan Ahmad Addary Padangsidimpuan
Rusnai Rahayu -  UIN Syekh Ali Hasan Ahmad Addary Padangsidimpuan
Fahmi Izhari -  UIN Syekh Ali Hasan Ahmad Addary Padangsidimpuan
Dedek Armadi -  UIN Syekh Ali Hasan Ahmad Addary Padangsidimpuan

Abstract


The interior route from Binjai to Padangsidimpuan spanning approximately 380 km poses unique challenges due to travel time fluctuations caused by local market congestion, infrastructure repairs, and landslide-prone mountainous terrains. Conventional static Dijkstra routing algorithms evaluate physical distance parameters alone, causing significant latency when handling real-time blockages. This study implements a dynamic Dijkstra framework that ingests continuous traffic API data feed streams to form stochastic, dynamically weighted graphs. Computational simulations deployed across prominent bottlenecks (Tebing Tinggi, Pematangsiantar, Tarutung, and Sipirok) reveal that although alternative bypass configurations demand longer spatial pathways (+35 km), the algorithm consistently cuts total travel time by 18.5% during maximum peak congestion windows. This validates resilient smart routing systems over the Trans-Sumatra network infrastructure.

Keywords: Shortest Path; Dynamic Dijkstra Algorithm; Trans-Sumatra Highway; Real-Time Traffic.

The interior route from Binjai to Padangsidimpuan spanning approximately 380 km poses unique challenges due to travel time fluctuations caused by local market congestion, infrastructure repairs, and landslide-prone mountainous terrains. Conventional static Dijkstra routing algorithms evaluate physical distance parameters alone, causing significant latency when handling real-time blockages. This study implements a Dynamic Dijkstra framework that ingests continuous traffic API data feed streams to form stochastic, dynamically-weighted graphs. Computational simulations deployed across prominent bottlenecks (Tebing Tinggi, Pematangsiantar, Tarutung, and Sipirok) reveal that although alternative bypass configurations demand longer spatial pathways (+35 km), the algorithm consistently cuts total travel time by 18.5% during maximum peak congestion windows. This validates resilient smart routing systems over the Trans-Sumatran network infrastructure.

Keywords: Shortest Path; Dynamic Dijkstra Algorithm; Trans-Sumatra Highway; Real-Time Traffic.


Full Text:

PDF

References


Linhar, A., et al., (2025). Penerapan algoritma A untuk menentukan jalur terpendek dari Sipirok ke UIN Syahada Padangsidimpuan. TECHSI: Jurnal Teknik Informatika, 16(2). https://doi.org/10.29103/techsi.v16i2.25797

Bastani, M., Ghoseiri, K., & Shahzad, F. (2019). Dynamic route optimization for urban freight transportation networks under stochastic congestion. Journal of Transport Geography, 78(1), 104-118.

Bunaen, M. C., Pratiwi, H., & Riti, Y. F. (2022). Penerapan Algoritma Dijkstra untuk Menentukan Rute Terpendek dari Pusat Kota Surabaya ke Tempat Bersejarah. Jurnal Teknologi Dan Sistem Informasi Bisnis, 4(1), 211-222.

Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms (3rd ed.). MIT Press.

Dijkstra, E. W. (1959). A note on two problems in connection with graphs. Numerische Mathematik, 1(1), 269-271.

Kumar, R., & Singh, P. (2022). A review of dynamic shortest path algorithms in intelligent transportation systems. International Journal of Traffic and Transportation Engineering, 12(3), 345-360.

Li, X., & Zhou, M. (2021). Hybrid A* and dynamic Dijkstra routing algorithm for real-time navigation in massive traffic networks. IEEE Transactions on Intelligent Transportation Systems, 22(8), 5112-5125.

Masri, M., Kiswanto, Pratomo, A., & Kusuma, B. S. (2019). Implementasi Algoritma Dijkstra dalam Perancangan Pariwisata Danau Toba dan Sekitarnya. Jurnal Nasional Teknologi dan Sistem Informasi, 5(3), 221-225.

Nasution, A. H. (2022). Analisis hambatan samping terhadap kinerja jalan arteri nasional Lintas Tengah Sumatra Utara. Jurnal Teknik Sipil dan Infrastruktur, 10(2), 89-102.

Pradhan, S., & Maharjan, R. (2023). Stochastic travel time prediction using floating car data and real-time feed integration. Transportation Research Part C: Emerging Technologies, 149(2), 104-121.

Rahman, M. M., & Tanaka, H. (2021). Adaptive routing algorithms for heavy commercial logistics vehicles in mountainous networks. Journal of Advanced Transportation, 2021(1), 1-15.

Siregar, F. A., & Hutabarat, M. (2021). Dampak dibukanya Tol Trans-Sumatera terhadap distribusi beban lalu lintas jalan arteri Lintas Tengah. Jurnal Transportasi Multimoda, 19(1), 45-58.

Wang, L., & Liu, Y. (2023). Dynamic Dijkstra framework with geomorphological and side-friction penalties for commercial fleet routing. Computer-Aided Civil and Infrastructure Engineering, 38(4), 489-505.

Zheng, Y., & Ni, J. (2022). Edge-computing integrated routing systems for emergency vehicle dispatching under sudden lane blockages. Safety Science, 154(1), 105-119.

Zhang, Y., & Rahmani, F. (2020). Historical vs. real-time traffic data integration in urban shortest path algorithms. Transportation Research Record, 2674(5), 211-224.


Refbacks

  • There are currently no refbacks.