Implementasi Algoritma Kruskal untuk Menentukan Minimum Spanning Tree Rute Tempat Pembuangan Sampah Berbasis GUI
DOI:
https://doi.org/10.47065/bulletincsr.v6i2.998Keywords:
Kruskal’s Algorithm; Java GUI; Minimum Spanning Tree; Waste Disposal Sites (TPS); Optimal RouteAbstract
Waste management in urban areas such as Surabaya faces dual challenges of increasing waste volume and operational efficiency. The city’s daily waste production of approximately 1,800 tons requires a precise logistics system to reduce transportation costs, which account for 60% to 85% of the total municipal waste management budget. This study aims to optimize waste collection routes in East Surabaya, a rapidly growing area. Kruskal’s algorithm was implemented to determine the Minimum Spanning Tree (MST) of the waste disposal network. The Waterfall software development model was applied to build a Java-based Graphical User Interface (GUI) application that visualizes optimal routes with minimal total distance. Distance data among six waste disposal sites (TPS) were obtained from actual road mapping and modeled as a weighted graph. The selection of only six TPS was intended as a case study to simplify the initial modeling process, which presents certain limitations in generalization but remains relevant for demonstrating route optimization potential. The results show that Kruskal’s algorithm produced an MST structure with a minimum total distance of 11 km. The developed application was tested and proved effective in supporting route planning and providing user-friendly graphical visualization. This research is expected to contribute to decision-making in optimizing urban waste collection logistics.
Downloads
References
M. H. Arifin, “Produksi Sampah di Surabaya Mencapai 1.800 Ton per Hari, Bisa Berkurang karena Masyarakat Masif Memilah,” Suara Surabaya, 2024.
M. F. Miftahadi, I. Rachman, dan T. Matsumoto, “Optimizing Indonesian municipal solid waste collection scenarios: Integration of multi-objective search simulation and social cost–benefit analysis,” J. Mater. Cycles Waste Manag., vol. 26, no. 3, hal. 1569–1587, 2024, doi: 10.1007/s10163-024-01910-0.
B. C. Koloway, “Produksi Sampah di Surabaya Capai 1.800 Ton per Hari, Pemkot Gelontorkan Rp462 Miliar per Tahun,” TribunJatim, 2025.
M. F. Jatmiko, Y. P. Wijianto, dan F. Z. Abidin, “Optimalisasi Rute Suroboyo Bus untuk Menjangkau Area Permukiman Baru,” KERN J. Ilm. Tek. Sipil, vol. 10, no. 2, hal. 101–110, 2025, doi: 10.33005/kern.v10i2.80.
M. N. B. A. Yasin dan N. A. Pratomoatmojo, “Analisis Fenomena Densifikasi Perkotaan pada Wilayah Surabaya Timur dengan Metode Point Pattern Analysis,” J. Tek. ITS, vol. 10, no. 1, hal. C26–C32, 2021.
BPS Kota Surabaya, “Kota Surabaya dalam Angka,” 2025.
R. A. Mahmudah dan W. Herumurti, “Analisis Sistem Pengangkutan Sampah di Wilayah Surabaya Utara,” J. Tek. ITS, vol. 5, no. 2, hal. D103–D108, 2016.
M. Chaerul, M. Puturuhu, dan I. Artika, “Optimasi Rute Pengangkutan Sampah dengan Menggunakan Metode Nearest Neighbour (Studi Kasus?: Kabupaten Manokwari, Papua Barat),” J. Wil. dan Lingkung., vol. 10, no. April, hal. 55–68, 2022, doi: 10.14710/jwl.10.1.55-68.
I. D. Herrera-Granda, J. Cadena-Echeverría, J. C. León-Jácome, E. P. Herrera-Granda, D. Chavez Garcia, dan A. Rosales, “A Heuristic Procedure for Improving the Routing of Urban Waste Collection Vehicles Using ArcGIS,” Sustain. , vol. 16, no. 13, 2024, doi: 10.3390/su16135660.
N. P. Akpan dan I. A. Iwok, “A Minimum Spanning Tree Approach of Solving a Transportation Problem,” Int. J. Math. Stat. Invent., vol. 5, no. 3, hal. 8–17, 2017.
A. Hosseini, “Uncertainty-Driven Stability Analysis of Minimum Spanning Tree Under Multiple Risk Variations,” Mathematics, vol. 13, hal. 1–20, 2025, doi: https://doi.org/10.3390/math13193100.
A. Levitin, Introduction to the Design & Analysis of Algorithms, Third. in Always learning. Pearson, 2012.
W. C. Ekasaputra dan M. A. I. Pakereng, “Visualisasi Algoritma Kruskal dan Prim dalam Mencari Rute Terpendek Berbasis Unity 3D,” J. JTIK (Jurnal Teknol. Inf. dan Komunikasi), vol. 7, no. 3, hal. 458–464, 2023, doi: 10.35870/jtik.v7i3.866.
A. Maulana, “Penerapan Kruskal Minimum Spanning Tree Pada Optimasi Rute Wisata Bojong Kabupaten Tegal,” J. Rekayasa Inform., vol. 2, no. 1, hal. 36–45, 2025.
Y. P. W. Rizkha Mardhatillah, Yulanda Rahmadiyah, “Implementasi Algoritma Kruskal dalam Menentukan Rute Terdekat di Fakultas Universitas Jambi Kampus Pinang Masak,” Multi Prox. J. Stat. Univ. Jambi, vol. 1, no. 2, hal. 71–81, 2022, doi: doi.org/10.22437/multiproximity.v1i2.17937.
S. Khoiriyah, N. Febriyanti, A. Oktavia, G. F. Tineza, dan F. Huda, “Implementasi Algoritma Kruskal Berbasis Budaya Lokal dalam Menentukan Rute Terpendek Napak Tilas Racana UMPRI,” J. Pendidik. Tambusai, vol. 9, no. 3, hal. 40385–40393, 2025.
N. Arif Sudibyo, T. Purwanto, dan D. Rahmadi, “Minimum Spanning Tree Pada Distribusi Bahan Naskah USBN SD/MI Di Kabupaten Sragen,” Riemann Res. Math. Math. Educ., vol. 2, no. 2, hal. 64–69, 2020.
E. Sartika, A. Lusiani, I. Suhartini, dan N. Nuryati, “Algoritma Kruskal Untuk Menyelesaikan Masalah Optimasi Distribusi Jaringan Listrik di PLN UP3 Cimahi,” Epsil. J. Mat. Murni Dan Terap. (Epsilon J. Pure Appl. Math., vol. 18, no. 2, hal. 192, 2024, doi: 10.20527/epsilon.v18i2.13256.
M. C. Ryadiani, N. Ardianingsih, dan R. Matheus, “Implementasi Algoritma Kruskal Untuk Optimasi Pengangkutan Sampah,” in Seminar Nasional Komputer dan Sistem Intelijen 2012, Indonesia, 2012.
Erniyati dan P. Citra, “The implementation of the Kruskal algorithm for the search for the shortest path to the location of a building store in the city of Bogor,” IOP Conf. Ser. Mater. Sci. Eng., vol. 621, no. 1, hal. 2–11, 2019, doi: 10.1088/1757-899X/621/1/012010.
J. S. Kumar dan S. E.N, “An application of Spanning Tree Algorithm to Municipal Solid Waste Management,” Int. J. Math. Trends Technol., vol. 51, no. 4, hal. 303–306, 2017, doi: 10.14445/22315373/ijmtt-v51p539.
P. O. Ayegba, A. E. Okeyinka, M. Adebiyi, E. O. Asani, J. A. Ayoola, dan G. C. Ben, “Comparative Performance Analysis of Kruskal and Prim MST Algorithms,” Int. J. Eng. Res. Technol., vol. 13, no. 12, hal. 5386–5391, 2020, [Daring]. Tersedia pada: http://www.irphouse.com/ijert20/ijertv13n12_181.pdf
N. T. S. Saptadi dan V. P. Taga, “Penerapan Algoritma K-Means Dalam Mengatasi Permasalahan Sampah (Studi Kasus: Pola Perilaku Masyarakat Dalam Membuang Sampah),” Temat. J. Penelit. Tek. Inform. dan Sist. Inf., vol. 10, no. 1, hal. 1–14, 2022, doi: 10.56963/tematika.v10i1.134.
R. R. Maciel, A. D. de Souza, R. M. A. Almeida, dan J. P. R. R. Leite, “The Impact of IoT-Enabled Routing Optimization on Waste Collection Distance: A Systematic Review and Meta-Analysis,” Logistics, vol. 9, no. 4, hal. 1–27, 2025, doi: 10.3390/logistics9040161.
Z. A. Pandana dan P. Firdaus, “Kerjasama Sister City Antara Pemerintah Kota Surabaya dan Kota Kitakyushu Sebagai Upaya Pengelolaan Sampah Tahun 2012-2023,” Glob. Focus, vol. 04, no. 01, hal. 22–43, 2024, doi: https://doi.org/10.21776/ub.jgf.2024.004.01.2.
D. S. Kusuma dan S. Wibawani, “Strategi Pengelolaan Sampah di Super Depo Sutorejo Kota Surabaya,” NeoRespublica J. Ilmu Pemerintah., vol. 5, no. 2, hal. 929–941, 2024, doi: 10.52423/neores.v5i2.276.
I. Sommerville, Software Engineering, 10 ed. Pearson, 2016.
R. S. Pressman dan B. R. Maxim, Software Engineering: A Practitioners Approach, 9th ed. McGraw-Hill Education, 2019.
J. L. Whitten dan L. D. Bentley, Systems Analysis and Design Methods. McGraw-Hill/Irwin, 2004.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Implementasi Algoritma Kruskal untuk Menentukan Minimum Spanning Tree Rute Tempat Pembuangan Sampah Berbasis GUI
ARTICLE HISTORY
How to Cite
Issue
Section
Copyright (c) 2026 Moch. Anang Karyawan, Yusuf Effendi, Muhammad Zakariya Alif Ridwan, Maulana Muhammad Adityawarman, Muhammad Khairul Ikhwan
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).
