ALGORITMA KRUSKAL UNTUK MENYELESAIKAN MASALAH OPTIMASI DISTRIBUSI JARINGAN LISTRIK DI PLN UP3 CIMAHI

Euis Sartika, Anie Lusiani, Ida Suhartini, Neneng Nuryati

Abstract


The addition of new houses in the Kota Mas Cimahi housing complex has triggered an increase in the need for electricity distribution installations. To optimize the electricity distribution network, in this case minimizing the installation of electrical cables, an application is needed that can optimize the installation of electrical cables, namely the Kruskal algorithm which is an algorithm for finding the minimum spanning tree value on a weighted graph. In this study, two methods will be used, namely the manual method and the POM-QM for Windows software to help solve the minimum spanning tree problem. This study's goal is to identify the Kota Mas Cimahi housing complex's energy distribution network model's graph structure and determine a minimum spanning tree solution with POM-QM for Windows software and the Kruskal technique done by hand. In order to gather data for this study, PLN was the primary and secondary source Cimahi UP3. The distribution data for the electricity cable network is arranged in the form of a network image. By representing the electricity distribution network in the form of a graph, the minimum spanning tree is then obtained, and the solution to the MST (Minimum Spanning Tree) problem uses the Kruskal algorithm and TORA software. The results of the study showed that the minimum spanning tree cable length which was originally 1424.61 meters, after using the Kruskal algorithm manually became 1258.05 meters and also by using the POM-QM for Windows software obtained a minimum result of 1258.05 meters, so it can be concluded that there is a cable length efficiency of 11.69%.


Keywords


Kruskal Algorithm, Minimum Spanning Tree, POM-QM for Windows

Full Text:

PDF

References


Amaliah, U., & Fajar, M. Y. (2023). Penerapan Metode EOQ untuk Optimalisasi Pengendalian Jumlah Persediaan Obat di Puskesmas. Jurnal Riset Matematika. Vol. 3(1), 83–90.

Ayegba, P., Ayoola, J., Asani, E., & Okeyinka, A. (2020). A comparative study of minimal spanning tree algorithms. 2020 International Conference in Mathematics, Computer Engineering and Computer Science (ICMCECS). 1–4.

Buol, A. A. S. O., Rumba, M. F. R., & Wara, F. A. W. (2019). Penentuan Panjang Optimal Pipa Air Optimal di Perumnas Maumere Menggunakan Algoritma Kruskal. Increate-Inovasi dan Kreasi dalam Teknologi Informasi. Vol. 6(1). DOI: 10.11591/ijeecs.v16.i1.pp1-8

Fujie, T. (2003). An exact algorithm for the maximum leaf spanning tree problem. Computers & Operations Research Japan. Vol. 30(13), 1931–1944.

Lusiani, A., Purwaningsih, S. S., & Sartika, E. (2023). Dijkstra Algorithm in Determining The Shortest Route for Delivery Service by J&T Express in Bandung. Jurnal Lebesgue: Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika. Vol. 4(2), 940–948.

Lusiani1, A., Sartika, E., Binarto, A., Habinuddin, E., & Azis, I. (2021). Determination of the Fastest Path on Logistics Distribution by Using Dijkstra Algorithm. 2nd International Seminar of Science and Applied Technology (ISSAT 2021). 246–250.

Lusiani2, A., Sartika, E., Habinuddin, E., Binarto, A., & Azis, I. (2021). Algoritma Prim dalam Penentuan Lintasan Terpendek dan Lintasan Tercepat pada Pendistribusian Logistik Bulog Jawa Barat. Prosiding Industrial Research Workshop and National Seminar. Vol. 12, 673–677.

Munir, R. (2016). Matematika Diskrit (Edisi Ketiga. Bandung: Informatika.

Niluminda, K. P. O., & EMUSB, E. (2022). An Efficient Method to Solve Minimum Spanning Tree Problem Using Graph Theory and Improved Ant Colony Optimization Algorithm. North American Academic Research. Vol. 5(12), 34–43.

Dili, Y. N, Wulan, E. R., & Ilahi, F. (2021). Penyelesaian Masalah Transportasi untuk Mencari Solusi Optimal dengan Pendekatan Minimum Spanning Tree (MST) Menggunakan Algoritma Prim. KUBIK: Jurnal Publikasi Ilmiah Matematika. Vol. 6(1), 44-50.

DOI: https://doi.org/10.15575/kubik.v6i1.13907

Rahmadi, D., & Sandariria, H. (2023). Penerapan Minimum Spanning Tree dalam Menentukan Rute Terpendek Distribusi Naskah Soal USBN di SMA Negeri se-Sleman. Basis: Jurnal Ilmiah Matematika. Vol. 2(1), 66–71.

Sembiring, R. R. (2022). Penerapan Algoritma Prim dalam Menentukan Minimum Spanning Tree (MST)(Studi Kasus: Jaringan Pipa PDAM Tirta Muaro Jambi). Universitas Jambi.

Simbolon, A. F. A. (2021). Aplikasi Minimum Spanning Tree pada Jaringan Listrik dI Desa Simatorkis Kecamatan Dolok Kabupaten Paluta. Unimed.

Situmorang, Y. M., & Mansyur, A. (2023). Pengoptimalan Jaringan Pipa Primer PDAM Tirtanadi Cabang Tuasan Dengan Menggunakan Algoritma Kruskal. Jurnal RIiset Rumpun Matematika Dan Ilmu Pengetahuan Alam. Vol. 2(2), 221–237.

Steen, M.V. (2010). An Introduction to Graph Theory and Complex Networks. https://pages.di.unipi.it/ricci/book-watermarked.pdf

Wahyuningsih, P. (2024). Peningkatan Kompetensi Input dan Pengelompokan Data Melalui Aplikasi Microsoft Excel Menggunakan Fitur Sort dan Filter. Devozione: Jurnal Pengabdian Multidisiplin Mahasiswa. Vol. 1(1), 64–69.

Wamiliana, W. (2022). Minimum Spanning Tree dan Desain Jaringan. Bandar Lampung: Pusaka Media.

Wattimena, A. Z., & Lawalatta, S. (2013). Aplikasi Algoritma Kruskal dalam Pengotimalan Panjang Pipa. Barekeng: Jurnal Ilmu Matematika Dan Terapan. Vol. 7(2), 13–18.

Weiss, H. J. (2004). POM-QM for Windows Version 4. New Jersey: Pearson Prentice Hall




DOI: https://doi.org/10.20527/epsilon.v18i2.13256

Refbacks

  • There are currently no refbacks.


Copyright (c) 2024 EPSILON: JURNAL MATEMATIKA MURNI DAN TERAPAN (EPSILON: JOURNAL OF PURE AND APPLIED MATHEMATICS)

Indexed by: 

      

 

EDITORIAL OFFICE 

           

 

 

 

Creative Commons License
All articles published in "Epsilon: Jurnal Matematika Murni dan Terapan" are licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License (CC BY-NC-SA 4.0). Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.