Optimizing Campus Promotion Routes Through the Application of Dijkstra’s Algorithm
Keywords:
Dijkstra Algorithm, Route Optimization, Campus Promotion, efficiency, promotion locations , geographical mappingAbstract
This study aims to optimize campus promotion routes using Dijkstra's algorithm to increase efficiency in time and cost. By applying this method, the shortest and fastest paths to target promotion locations can be optimally determined. Data were obtained through geographical mapping of schools and road accessibility. The implementation of Dijkstra’s algorithm was analyzed in terms of effectiveness and efficiency compared to conventional methods. This study is expected to contribute to enhancing the effectiveness of campus promotion strategies through route optimization.
References
Widianto, T. (2021). Optimalisasi metode weighted-sum dijkstra algorithm untuk menentukan rute terbaik yang sesuai dengan kebutuhan. Jurnal CoreIT: Jurnal Hasil Penelitian Ilmu Komputer Dan Teknologi Informasi, 7(1), 13. https://doi.org/10.24014/coreit.v7i1.11625
Bellman, R. (1958). On a routing problem. Quarterly of Applied Mathematics, 16(1), 87–90.
Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to Algorithms. MIT Press.
Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.
Lakutu, N. F., Mahmud, S. L., Katili, M. R., & Yahya, N. I. (2023). Algoritma Dijkstra dan Algoritma Greedy untuk Optimasi Rute Pengiriman Barang. Euler, 11(1), 55–65.
Liu, C., & Ban, X. (2013). Shortest path algorithms in transportation network studies. Transportation Research Part B: Methodological, 57, 34–56.
Ramadan, D. C., & Ramury, F. (2023). Penerapan Algoritma Dijkstra untuk Menentukan Rute Terpendek dari Kampus ke Tempat Bersejarah. Diophantine Journal, 2(2).
Rufus, E. C., Riyadi, R. R., Hasibuan, D. N., Christian, E., & Pranatawijaya, V. H. (2024). Penerapan Dijkstra pada Pengiriman Barang. JATI, 8(3), 3387–3391.
Sutanto, D., & Syahputra, R. (2023). Implementasi Dijkstra dalam Jalur Terpendek. Jurnal TIK, 9(2), 134–142.
Widodo, S., & Lestari, D. (2021). Optimalisasi Jalur Distribusi. Jurnal Teknologi Sistem Komputer, 9(4), 312–319.
Wita, D. S. (2022). Implementasi Algoritma Dijkstra untuk Penentuan Rute Terpendek Puskesmas. Inspiration, 12(1), 88–95.
