Article Per Year (5 Year)
p-Index From 2021 - 2026
3.035
P-Index
This Author published in this journals
All Journal Epsilon: Jurnal Matematika Murni dan Terapan UNEJ e-Proceeding MUST: Journal of Mathematics Education, Science and Technology JURNAL PENGABDIAN KEPADA MASYARAKAT Teorema: Teori dan Riset Matematika IJISTECH (International Journal Of Information System & Technology) Jurnal Saintika Unpam : Jurnal Sains dan Matematika Unpam Jurnal Pengabdian Masyarakat Bumi Raflesia Jurnal Lebesgue : Jurnal Ilmiah Pendidikan Matematika, Matematika dan Statistika IJISTECH Jurnal Difusi Industrial Research Workshop and National Seminar Tedc STATISTIKA
Euis Sartika
Politeknik Negeri Bandung
Religion Agriculture, Biological Sciences & Forestry Humanities Automotive Engineering Chemical Engineering, Chemistry & Bioengineering Chemistry Civil Engineering, Building, Construction & Architecture Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Engineering Environmental Science Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Library & Information Science Materials Science & Nanotechnology Mathematics Mechanical Engineering Physics Public Health Social Sciences Transportation Veterinary Other

Published : 22 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 22 Documents
Search

 1   2   3 
Perbandingan Algoritma Kruskal dan Prim dalam Menentukan Minimum Spanning Tree untuk Optimasi Jaringan Distribusi Listrik Euis Sartika; Anie Lusiani
MUST: Journal of Mathematics Education, Science and Technology Vol 11 No 1 (2026): JULI
Publisher : Universitas Muhammadiyah Surabaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30651/must.v11i1.28234

Abstract

This study aims to compare the performance of the Kruskal and Prim algorithms in solving the Minimum Spanning Tree (MST) problem in the PLN UP3 Cimahi electricity distribution network using Python-based Google Colab. The study uses an applied research method with data in the form of electrical network cable lengths modeled as weighted graphs. Analysis was carried out using the NetworkX library on Google Colab to form MSTs using both algorithms. The results show that both algorithms produce the same total MST weight of 1258.05 meters, smaller than the initial network length of 1424.61 meters, resulting in an efficiency of 11.69%. Although producing identical solutions, the Kruskal algorithm is simpler to apply to networks with a large number of nodes because the weight sorting process is carried out at the beginning. This study shows that Google Colab is an effective medium for learning and implementing graph theory-based network optimization.
ALGORITMA KRUSKAL UNTUK MENYELESAIKAN MASALAH OPTIMASI DISTRIBUSI JARINGAN LISTRIK DI PLN UP3 CIMAHI Euis Sartika; Anie Lusiani; Ida Suhartini; Neneng Nuryati
EPSILON: JURNAL MATEMATIKA MURNI DAN TERAPAN Vol 18, No 2 (2024)
Publisher : Mathematics Study Program, Faculty of Mathematics and Natural Sciences, Lambung Mangkurat

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.20527/epsilon.v18i2.13256

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%.
Co-Authors Agus Binarto Anny Suryani Endang Habinuddin Endang Habinuddin Fatya Alty Amalia Hadiani, Fatmi Hedi Hedi Ida Suhartini Irfani Azis Jayanti, Retno Dwi Karnisah, Iin Lusiani, Anie Muldiani, Ratu Fenny Neneng Nuryati Siti S Purwaningsih Siti S. Purwaningsih Siti Samsiyah Purwaningsih Sosianika, Adila Sri Murniati Sri Suratmi Sri Suratmi Yuliah, Siti