Optimalisasi Jalur Pedestrian Antar Fakultas Di Universitas Mataram Menggunakan Algoritma Kruskal
DOI:
10.29303/jm.v7i2.8988Published:
2025-06-02Downloads
Abstract
Efficient pedestrian pathways between faculties and key locations within the Universitas Mataram campus are a crucial aspect in supporting the academic and non-academic mobility. Optimization of pedestrian paths based on distance and connectivity efficiency between important points. This study aims to identify and optimize as well as determine the shortest pedestrian paths between faculties by applying the Kruskal algorithm, which connects all points without forming cycles based on the Minimum Spanning Tree (MST) method. There are 13 vertices representing faculties or key locations at Universitas Mataram. The distances between these faculties or places are represented as weighted edges measured in meters. A total of 15 edges were initially identified according to the algorithm’s execution. Among these, 3 edges formed cycles and had to be gradually eliminated in order to comply with Kruskal’s algorithm, resulting in the optimal solution of 12 edges for the shortest pedestrian network. The distances of these 12 edges were obtained through mapping using Google Maps. The total length of the resulting optimized pedestrian route is 2,650 meters or 2.65 kilometers. These findings can serve as a reference for policymakers at Universitas Mataram to consider in the development of network-based pedestrian infrastructure.
Keywords:
Pedestrian Path, Kruskal Algorithm, Minimum Spanning Tree, Cycle, Vertex, EdgeReferences
Ar Ruhimat, Q. A., Slamin, S., & Malinda, A. (2024). Efektivitas Algoritma Kruskal dalam Mengoptimalkan Jalur Terpendek pada Jaringan Intranet. JSN : Jurnal Sains Natural, 2(3), 59–67. https://doi.org/10.35746/jsn.v2i3.546
Dey, A., Broumi, S., Son, L. H., Bakali, A., Talea, M., & Smarandache, F. (2019). A new algorithm for finding minimum spanning trees with undirected neutrosophic graphs. Granular Computing, 4(1), 63–69. https://doi.org/10.1007/s41066-018-0084-7
Didiharyono dan Soraya, S. (2018). Penerapan Algoritma Greedy dalam Menentukan Minimum Spanning Trees pada Optimisasi Jaringan Listrik Jala Didiharyono, Siti Soraya. Jurnal Varian, 1(2), 1–10. https://doi.org/https://doi.org/10.30812/varian.v1i2.66
Fuad, M. A., Sartimbul, A., Iranawati, F., Sambah, A. B., Yona, D., & Hidayati, N. (2019). Metode Penelitian Kelautan dan Perikanan. UB Press.
Kusnadi, K., Gata, W., & Nova Arviantino, F. (2022). Aplikasi Algoritma Kruskal dan Sollin Pada Jaringan Transmisi Nasional Provinsi Sulawesi Selatan. Metik Jurnal, 6(1), 8–17. https://doi.org/10.47002/metik.v6i1.260
Made Ayu Ulandari, N., Amrullah, A., Junaidi, J., & Subarinah, S. (2021). Implementasi Algoritma Kruskal Dalam Menentukan Rute Terdekat Pada Tempat Pariwisata di Daerah Lombok Tengah. Griya Journal of Mathematics Education and Application, 1(4), 578–589. https://doi.org/10.29303/griya.v1i4.117
Manaroinsong, J. (2013). Metodelogi Penelitian (Terapan Bidang Ekonomi dan Bisnis) Surabaya: CV. R.A.De.Rozarie. CV. R.A.De.Rozarie.
Marsudi. (2016). Teori Graf (1st ed.). Universitas Brawijaya Press.
Munier, B., Aleem, M., Islam, M. A., Iqbal, M. A., & Mehmood, W. (2017). A Fast Implementation of Minimum Spanning Tree Method and Applying it to Kruskal’s and Prim’s Algorithms. Sukkur IBA Journal of Computing and Mathematical Sciences, 1(1), 58–66. https://doi.org/10.30537/sjcms.v1i1.8
Pop, P. C., Matei, O., Sabo, C., & Petrovan, A. (2018). A two-level solution approach for solving the generalized minimum spanning tree problem. European Journal of Operational Research, 265(2), 478–487. https://doi.org/10.1016/j.ejor.2017.08.015
Seweken, G. (2021). Matematika Diskrit (1st ed.). RajaGrafindo Persada.
Siregar, M. K. (2018). Matematika Diskrit (A. Hastono (ed.); 1st ed.). Perahu Litera.
Sudaryono, D. (2016). Metode Penelitian Pendidikan. Kencana.
Tamber, A. J., Ikpotokin, F. O., & Okafor, L. U. (2020). The Minimum spanning Tree of the Nigeria roads Network through Mullple-Roads. 3(2), 151–157.
Wulandari, D. A. R., & Arifin, F. N. (2018). Penentuan Rute Terpendek Jalur Distribusi Air Artesis Menggunakan Kruskal. J-SAKTI (Jurnal Sains Komputer Dan Informatika), 2(2), 121. https://doi.org/10.30645/j-sakti.v2i2.72
License
Copyright (c) 2025 Gilang Primajati Gilang, M. Gunawan Supiarmo, Dita Oktavihari
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
